#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0;i<n;i++)
using namespace std;
const long long MOD = 1e9+7;
int main(){
    int n;
    cin >> n;
    long long c[n];
    rep(i,n) cin >> c[i];
    sort(c,c+n);
    long long nibeki[2*n];
    nibeki[0]=1;
    rep(i,2*n-1){
        nibeki[i+1]=2*nibeki[i];
        nibeki[i+1]%=MOD;
    } 
    long long ans = 0;
    rep(i,n){
        long long tmp = c[i];
        tmp%=MOD;
        long long rank = n-i;
        long long tmp2 = (rank-1)*nibeki[rank-2]+nibeki[rank-1];
        tmp2%=MOD;
        tmp*=tmp2;
        tmp%=MOD;
        tmp*=nibeki[2*n-rank];
        tmp%=MOD;
        ans+=tmp;
        ans%=MOD;
    }
    cout << ans << endl;
}