#include <iostream>
#include <vector>
#include <bitset>
#include <utility>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
 
using namespace std;
typedef long long ll;
 
int main(){
  ll p=1000000007;
  ll N;
  cin >> N;

  vector<int> c(N);
  for(auto &ci:c) cin >> ci;

  sort(c.begin(),c.end());

  //for(auto ci:c) cout << ci << endl;
  
  ll ans=0;
  for(int i=0;i<N;i++){
    //cout << c[i] << " " << N-i+1 << endl;
    ans+=c[i]*(N-i+1);
    ans%=p;
  }

  N=2*N-2;
  ll tmp=2;
  for(int i=0;i<61;i++){
    if(((ll)1<<i)&N){
      ans*=tmp; ans%=p;
    }
    tmp=tmp*tmp; tmp%=p;
  }
    
  cout << ans << endl;
  
  return 0;
}
