#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define fi first
#define se second
using namespace std;
#define sd(x) scanf("%d",&x)
#define pd(x) printf("%d",x)
#define sl(x) scanf("%lld",&x)
#define pl(x) printf("%lld",x)
#define mem(x,a) memset(x,a,sizeof(x))
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define all(v) v.begin(),v.end()
#define N (int)(2e5+20)
ll pow2[45];
int a[N];
void solve(){
    int n;
    sd(n);
    pow2[0]=1;
    for(int i=1;i<=40;i++){
        pow2[i]=(pow2[i-1]*(2ll));
    }
    for(int i=1;i<=n;i++){
        sd(a[i]);
    }
    sort(a+1,a+n+1);
    ll ans=0;
    for(int i=n;i>=0;i--){
        ans+=(a[i]*1ll*pow2[n-i]);
    }
    pl(ans);
}
int main(){
    //freopen("input.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t=1;
    //sd(t);
    for(int i=1;i<=t;i++){
       //printf("Case #%d: ",i);
       solve();
   }
   return 0;
}