#include <cstdio>
#include <iostream>
#include <vector>
#include <stack>
#include <utility>//pair
#include <functional>//greater
#include <queue>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <climits>
#include <iomanip>
#include <map>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<int,pair<int,int> > tii;
typedef vector<int> vec;
typedef vector<long long> vecll;
typedef vector<pair<int,int> > vec_pii;
typedef vector<vector<int> > ugraph;
typedef vector<vector<pair<int,int> > > wgraph;
#define mp make_pair
#define pb push_back
#define mod 1000000007
#define gcd(a,b) __gcd(a,b)
#define sf(n) scanf("%lld",&(n))
#define pf(n) printf("%lld\n",(n))
#define min3(a,b,c) (min((c),min((a),(b))))
#define max3(a,b,c) (max((a),max((b),(c))))
#define ff first
#define ss second
#define mset(a,b) memset(a,b,sizeof(a));
#define newline "\n"
#define countsetbits(n) __builtin_popcount((n))
#define setbit(mask,i) (mask = mask|(1<<i))
#define checkbit(mask,i) (1&(mask>>i))
int arr[50];
ll ans = 0;
int main()
{
    //ios_base::sync_with_stdio(false);
    //cin.tie(false);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    int n;
    cin>>n;

    for(int i=0;i<n;++i)
        cin>>arr[i];
    sort(arr,arr+n,greater<int>());

    for(int i=0;i<n;++i)
    {
        ans =ans + (1LL<<(ll)i)*arr[i];
    }
    cout<<ans<<endl;
}