codeforces——809A/810C——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 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 to n. 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 alla, where a 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 modulo 10⁹ + 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 integers x₁, 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

24 7

Output

3

Input

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

求所有子集 最大值与最小值的差 的和

先找规律，还要注意时间复杂度。

#include<iostream>#include<algorithm>#include<stdio.h>#include<cstring>#include<cmath>#include<map>using namespace std;long long func2(int A,int B);long long com[200000],a[300008],help1=1e9+7,pow2[300008]={1};int main(){    for(int i=1; i<=300002; i++)        pow2[i]=2*pow2[i-1]%help1;    int n;    while(~scanf("%d",&n))    {        for(int i=0; i<n; i++)            scanf("%d",&a[i]);        sort(a,a+n);        if(n<=2)            printf("%d\n",a[n-1]-a[0]);        else        {            long long ans=0;            for(int i=0; i<=(n+1)/2; i++)                if(n-i-1<i)                    break;                else                    ans=(func2(n-i-1,i)*(a[n-i-1]-a[i])+ans)%help1;            printf("%I64d\n",ans);        }    }    return 0;}long long func2(int A,int B){    long long ans=(pow2[B]*(pow2[A-B]-1))%help1;    return ans;}