#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef pair<long long,long long> pll;
typedef vector<int> vi;
typedef pair<double,double> pdd;
typedef vector<long long> vll;
typedef vector<double> vd;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;
 
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define MOD 1000000007
#define ll long long
ll GCD(ll a, ll b)
{
    return b? GCD(b,a%b) : a;
}
long long POW(long long Base, long long Exp)
{
    long long y,ret=1;
    y=Base;
    while(Exp)
    {
        if(Exp&1)
            ret=(ret*y)%MOD;
        y = (y*y)%MOD;
        Exp/=2;
    }
    return ret%MOD;
}
 
vll A,B,C,D,Res,Mark;
string str2,str1,s1,s2;
set<string> st;
stack<ll> chlo;
vpll Rec;

set<ll> At,Bt;
set<pll> Read;
set<pll>::iterator itr;
vector<string> kyu,andar,bahar;
#define itfr(it,stl) for(it=stl.begin();it!=stl.end();it++)

map <string, ll> Reg;
map<ll,ll> ::iterator it;


int main()
{
    ll i,j,k,l,n,m,x,y,z,t,tmp1,tmp2,tmp3,ind,Max,d1,d2;
	
	//cin>>t;
    //while(t--)
    {
		cin>>n;
		
		A.resize(n);
		
		for(i=0; i<n; i++)
							cin>>A[i];
							
		sort(A.rbegin(),A.rend());
		
		x = 1;
		
		z = 0;
		
		for(i=0; i<n; i++)
		{
			z += A[i]*x;
			x = x*2;
		}
		cout<<z<<endl;
		
	}
   	return 0;
}