For two sequences S and T of length N consisting of 0 and 1, let us define f(S, T) as follows:

* Consider repeating the following operation on S so that S will be equal to T. f(S, T) is the minimum possible total cost of those operations.

* Change S_i (from 0 to 1 or vice versa). The cost of this operation is D \times C_i, where D is the number of integers j such that S_j \neq T_j (1 \leq j \leq N) just before this change.



There are 2^N \times (2^N - 1) pairs (S, T) of different sequences of length N consisting of 0 and 1. Compute the sum of f(S, T) over all of those pairs, modulo (10^9+7).

Constraints

* 1 \leq N \leq 2 \times 10^5
* 1 \leq C_i \leq 10^9
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
C_1 C_2 \cdots C_N


Output

Print the sum of f(S, T), modulo (10^9+7).

Examples

Input

1
1000000000


Output

999999993


Input

2
5 8


Output

124


Input

5
52 67 72 25 79


Output

269312
import java.util.*;
import java.io.*;

// This file is a "Hello, world!" in Java language by OpenJDK for wandbox.

class Main
{
    public static void main(String[] args)
    {
        new Main().run();
    }
	
	final long MOD=(long)1e9+7;
	int MAX=(int)3e6;
	long[] fac=new long[MAX];
	long[] ifac=new long[MAX];
	long[] inv=new long[MAX];
	{
		fac[0]=fac[1]=ifac[0]=ifac[1]=inv[0]=inv[1]=1;
		for(int i=2;i<MAX;++i){
			fac[i]=i*fac[i-1]%MOD;
			inv[i]=MOD-inv[(int)MOD%i]*(MOD/i)%MOD;
			ifac[i]=inv[i]*ifac[i-1]%MOD;
		}
	}
	
	long comb(int n,int k){
		return fac[n]*ifac[k]%MOD*ifac[n-k]%MOD;
	}
	
	long pow(long a,long n){
		long ret=1;
		for(;n>0;n>>=1,a=a*a%MOD){
			if(n%2==1)ret=ret*a%MOD;
		}
		return ret;
	}
    
    void run(){
        Scanner sc=new Scanner(System.in);
		int N=sc.nextInt();
		long[] C=new long[N];
		for(int i=0;i<N;++i)C[i]=sc.nextLong();
		Arrays.sort(C);
		long dp=1;
		long ans=0;
		for(int i=N-1;i>=0;--i){
			long res=N-1-i;
			ans+=2*(pow(2,res)+res*pow(2,res-1)%MOD)%MOD*pow(2,res)%MOD*C[i]%MOD*pow(4,i)%MOD;
			ans%=MOD;
		}
		System.out.println(ans);
    }
	
	void tr(Object...o){
		System.out.println(Arrays.deepToString(o));
	}
}
// OpenJDK reference:
//   http://openjdk.java.net/

// Java language references:
//   http://docs.oracle.com/javase
