CF809A：Do you want a date?（数学 & 思维）

A. 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 to n 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 from 1 to n. So the i-th hacked computer is located at the point xi. 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, where a is a non-empty subset of the set, that consists of all hacked computers. Formally, let's denote A the set of all integers from 1 to n. Noora asks the hacker to find value of the expression . Here F(a) is calculated as the maximum among the distances between all pairs of computers from the set a. Formally, . Since the required sum can be quite large Noora asks to find it modulo 109 + 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·105) denoting the number of hacked computers.

The second line contains n integers x1, x2, ..., xn (1 ≤ xi ≤ 109) denoting the coordinates of hacked computers. It is guaranteed that all xi are distinct.

Output

Print a single integer — the required sum modulo 109 + 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 by 0and the third subset increases the sum by 7 - 4 = 3. In total the answer is 0 + 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.

题意：给一个数列，求其所有子集内最大值减最小值的和。

思路：先排序，固定左端点i，枚举右端点j，那么为答案贡献a[j]-a[i]的有2^(j-i-1)个子集，但是On^2必然超时，考虑到a[j]-a[i]，a[j+1]-a[i+1]这些有共同之处，列式子化简可发现和前缀和和后缀和有关。

# include <bits/stdc++.h>
using namespace std;

typedef long long LL;
const int maxn = 3e5+3;
const LL mod = 1e9+7;
LL a[maxn]={0}, b[maxn]={0}, c[maxn];

LL qmod(LL a, LL b)
{
    LL pow = a, ans = 1;
    while(b)
    {
        if(b&1) ans = ans*pow%mod;
        pow = pow*pow%mod;
        b >>= 1;
    }
    return ans;
}

int main()
{
    int n;
    scanf("%I64d",&n);
    for(int i=1; i<=n; ++i) scanf("%I64d",&c[i]);
    sort(c+1, c+1+n);
    for(int i=1; i<=n; ++i) a[i] = (a[i-1]+c[i])%mod;
    for(int i=n; i>=1; --i) b[i] = (b[i+1]+c[i])%mod;
    LL ans = 0;
    for(int i=1; i<=n; ++i)
        ans = (ans + ((b[n-i+1]-a[i]+mod)%mod)*qmod(2LL, (LL)i-1))%mod;
    printf("%I64d\n",ans);
    return 0;
}