CodeForces - 340C Tourist Problem

Iahub is a big fan of tourists. He wants to become a tourist himself, so he planned a trip. There are n destinations on a straight road that Iahub wants to visit. Iahub starts the excursion from kilometer 0. The n destinations are described by a non-negative integers sequence a1, a2, ..., an. The number ak represents that the kth destination is at distance ak kilometers from the starting point. No two destinations are located in the same place.

Iahub wants to visit each destination only once. Note that, crossing through a destination is not considered visiting, unless Iahub explicitly wants to visit it at that point. Also, after Iahub visits his last destination, he doesn't come back to kilometer 0, as he stops his trip at the last destination.

The distance between destination located at kilometer x and next destination, located at kilometer y, is |x - y| kilometers. We call a "route" an order of visiting the destinations. Iahub can visit destinations in any order he wants, as long as he visits all n destinations and he doesn't visit a destination more than once.

Iahub starts writing out on a paper all possible routes and for each of them, he notes the total distance he would walk. He's interested in the average number of kilometers he would walk by choosing a route. As he got bored of writing out all the routes, he asks you to help him.

Input

The first line contains integer n (2 ≤ n ≤ 105). Next line contains n distinct integers a1, a2, ..., an (1 ≤ ai ≤ 107).

Output

Output two integers — the numerator and denominator of a fraction which is equal to the wanted average number. The fraction must be irreducible.

Examples

Input

3
2 3 5

Output

22 3

Note

Consider 6 possible routes:

• [2, 3, 5]: total distance traveled: |2 – 0| + |3 – 2| + |5 – 3| = 5;
• [2, 5, 3]: |2 – 0| + |5 – 2| + |3 – 5| = 7;
• [3, 2, 5]: |3 – 0| + |2 – 3| + |5 – 2| = 7;
• [3, 5, 2]: |3 – 0| + |5 – 3| + |2 – 5| = 8;
• [5, 2, 3]: |5 – 0| + |2 – 5| + |3 – 2| = 9;
• [5, 3, 2]: |5 – 0| + |3 – 5| + |2 – 3| = 8.

The average travel distance is  =  = .

题解：给你一维上的一些点，坐标用自然数表示，起点为0，根据不同的遍历顺序遍历这些点(这些点不重复，遍历是指到达这个点，经过它并不算)，点与点之间的距离是两点坐标的绝对值，一条路径的长度等于根据某个顺序遍历完所有点所走的距离。求出所有路径的长度的平均值

题解：加上源点0，对于每个点，其他n个点到这个点的距离和的平均值即为到这个点距离的期望，n个点的期望加起来即可

我们用前缀和保存一下每个点的位置，详见代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1e5+10;
ll sumr[N],suml[N];
ll n,a[N];
int main()
{
	while(~scanf("%lld", &n))
	{
		for(int i=1;i<=n;i++)scanf("%lld",&a[i]);
		sort(a+1,a+1+n);
		sumr[n+1] = 0;
		for(int i=n;i>=1;i--) sumr[i]=sumr[i+1]+a[i];
		suml[0]=0;
		ll up = 0, down = n;
		for(int i=1;i<=n;i++)
		{
			sumr[i]-=a[i];
			ll cnt = sumr[i] - (ll)(n - i) * a[i] + (ll)i * a[i] - suml[i - 1];// suml 代表前面点位置和 sumr 代表后面位置和 
			suml[i]=a[i] + suml[i-1];
			up += cnt;
		}
		ll d = __gcd(up, down);
		printf("%lld %lld\n", up / d, down / d);
	}
	return 0;
}