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 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.

题意：嘛，看一下解释就知道了，就是找到任意的子集然后计算里面的最大差值，所有子集的最大差值的和就是我们要的答案。

嗯，我们可以先进行排序，从小到大，然后两两做差，不难发现这个问题就是每个差值分别被用了多少次的一个问题。

所以我们直接计算每个小差值的贡献度就可以了。

对于num[i] - num[i-1]的这个差值。它的贡献度是多少呢，其实就是num[1]~num[i-1]里面至少选一个元素，以及num[i]~num[n]之间至少选一个元素的总的情况数，那么利用组合数就可以发现是2^(i-1) -1 乘上 2^(n-i+1) - 1。

开始预处理一下2^x - 1 就可以了。

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5+7;
const int mod = 1e9+7;
int n,m;
long long num[MAXN];
long long ans[MAXN];
long long two[MAXN];
long long k[MAXN];
void get_k()
{
    two[0] = 1;
    for(int i = 1 ; i <= 300000 ; ++i)
    {
        two[i] = (two[i-1]*2)%mod;
        k[i] = (two[i] - 1 + mod)%mod;
    }
}


int main()
{
    get_k();
    scanf("%d",&n);
    for(int i = 1 ; i <= n ;++i)scanf("%I64d",&num[i]);
    sort(num+1,num+1+n);
    for(int i = 2 ; i <= n ;++i)ans[i] = num[i] - num[i-1];
    long long sum = 0;
    for(int i = 2 ; i <= n ; ++i)
    {
        sum = (sum + (ans[i]*((k[i-1]*k[n-i+1])%mod))%mod)%mod;
    }
    printf("%I64d\n",sum);
    return 0;
}