Company: Epam
Difficulty: medium
Deliver Pizzas Sanket is delivering pizzas today and has destinations along a straight line. He starts at point 0, with each destination located at a unique distance given by an array of non-negative integers ( a[i] is the distance of the i-th destination from the start). Sanket will visit each destination only once in any order he chooses, and must explicitly stop at each to deliver. The distance between two destinations a[i] and a[j] is calculated as |a[i] - a[j]| . Sanket ends his route at the final destination. Curious about the total distance he would travel on all possible routes, he wants to know the average distance per route. Since he\'s busy with deliveries, can you help calculate this? Input Format The first line of input contains a single integer n - the number of destinations. The second line of input contains n space-separated integers a 1 , a 2 , ..., a n - the distance of the i-th destination from the starting point. Output Format Print in a single line two space-separa