#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
typedef long long ll;
using namespace std;


int main() 
{   
    //2^j*c j is no. of cupcakes already eaten
    int n,inp;
    cin>>n;
    vector<int> c;
    for(int i = 0; i < n; i++)
    {
        cin>>inp;
        c.push_back(inp);
    }
    
    //minimize miles for Marc
    //the lesser the calorie the lesser the miles
    sort(c.begin(),c.end());
    reverse(c.begin(),c.end());
    ll miles;
    
    for(int i = 0; i < c.size(); i++)
    {
        miles += pow(2,i)*c[i];
    }
    
    cout<<miles;
    return 0;
}