Codeforces Round #415 (Div. 2)C. Do you want a date? （数学归纳）

C. Do you want a date?

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Leha decided to move to a quiet town Vičkopolis, because he was tired by living in Bankopolis. Upon arrival he immediately began to expand his network of hacked computers. During the week Leha managed to get access ton computers throughout the town. Incidentally all the computers, which were hacked by Leha, lie on the same straight line, due to the reason that there is the only one straight street in Vičkopolis.

Let's denote the coordinate system on this street. Besides let's number all the hacked computers with integers from1 ton. So thei-th hacked computer is located at the pointx_i. Moreover the coordinates of all computers are distinct.

Leha is determined to have a little rest after a hard week. Therefore he is going to invite his friend Noora to a restaurant. However the girl agrees to go on a date with the only one condition: Leha have to solve a simple task.

Leha should calculate a sum of F(a) for all a, wherea is a non-empty subset of the set, that consists of all hacked computers. Formally, let's denoteA the set of all integers from 1 to n. Noora asks the hacker to find value of the expression. HereF(a) is calculated as the maximum among the distances between all pairs of computers from the seta. Formally,. Since the required sum can be quite large Noora asks to find it modulo10⁹ + 7.

Though, Leha is too tired. Consequently he is not able to solve this task. Help the hacker to attend a date.

Input

The first line contains one integer n (1 ≤ n ≤ 3·10⁵) denoting the number of hacked computers.

The second line contains n integersx₁, x₂, ..., x_n(1 ≤ x_i ≤ 10⁹) denoting the coordinates of hacked computers. It is guaranteed that allx_i are distinct.

Output

Print a single integer — the required sum modulo 10⁹ + 7.

Examples

Input

2
4 7

Output

3

Input

3
4 3 1

Output

9

Note

There are three non-empty subsets in the first sample test:, and. The first and the second subset increase the sum by0 and the third subset increases the sum by 7 - 4 = 3. In total the answer is0 + 0 + 3 = 3.

There are seven non-empty subsets in the second sample test. Among them only the following subsets increase the answer:,,,. In total the sum is(4 - 3) + (4 - 1) + (3 - 1) + (4 - 1) = 9.

题意：给出一个集合，问它的子集的f(a)的和，f(a)代表着集合中的最大值减最小值。

分析：这题写了好久，数学确实差。首先能想到的是排序之后，必定是第i个和第j个，加上中间任意选可以组成的集合

它的f(a)=a[j]-a[i]，并且有 2^(j-i-1)个。不过这样会超时。

然后发现f(a)的值无非就是 a[i+k]-a[i]。那么假设k=1就得到

a[2]-a[1] 

a[3]-a[2]

a[4]-a[3]

a[n]-a[n-1]

加起来得到 a[n]-a[1]。然后列出k=2的发现是 a[n]+a[n-1]-a[1]-a[2]。

那么可以得到 ans[i]=sum[n]-sum[i+1]-sum[n-1-i]；

然后再结合前面发现的规律  anss[i]=ans[i]*(1<<i);

要注意取膜的时候做减法会出现负。

AC代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
#define mod 1000000007
long long a[350000];
long long sum[350000];
long long er[350000];
int main()
{
	int n;
	scanf("%d",&n);
	er[0]=1;
	for(int i=1;i<=n;i++)
	{
		er[i]=er[i-1]<<1;
		er[i]%=mod;
	}
	for(int i=1;i<=n;i++)
	scanf("%lld",&a[i]);
	sort(a+1,a+n+1);
	sum[0]=0;
	for(int i=1;i<=n;i++)
	sum[i]=(sum[i-1]+a[i])%mod;
	long long ans=0;
	for(int i=0;i<n-1;i++)
	{
		ans+=(er[i]*((sum[n]+mod-sum[1+i]+mod-sum[n-i-1])%mod))%mod;
		ans%=mod;
	}
	printf("%lld\n",ans);
	
}