#include<bits/stdc++.h>

using namespace std;
#define ll long long
#define INF 2000000000
//
#define pb push_back
#define pii pair<int,int>
#define X first
#define Y second
#define mod 1000000007
#define mp make_pair
//#define pi acos(-1.0)
//#define V 202
#define rep(i,a,b) for(int i=a;i<=b;i++)
//#define maxn 100005
//#define MAX_NUMBER_OF_NODES 100005
//#define MAX_ASCII_CODE 26
#define pi acos(-1.0)
#define pll pair<ll,ll>

ll Set(ll N,ll p){return N | (1<<p);}
ll reset(ll N,ll p){return  N & ~(1<<p);}
bool check(ll N,int p){ll fuck = 1;return (bool)(N & (fuck<<p));}
//int mod;

//map<ll,bool>asol;
//int Left[1000001],Right[1000001];

int arr[41];

int main()
{
    int n;
    cin>>n;
    ll one = 1;
    rep(i,0,n-1)cin>>arr[i];
    sort(arr,arr+n);
    ll sum = 0;
    ll prod=1;
    for(int i=n-1;i>=0;i--)
    {
        sum+=prod*arr[i];
        prod*=2;
    }
    cout<<sum<<endl;
}