#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>

#define ll long long
using namespace std;

int C[44];

int main() {
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        cin>>C[i];
    ll ans = 0;
    sort(C,C+n, std::greater<int>());
    for(int i=0;i<n;i++) {
        ans += (1ll<<i)*C[i];
    }
    
    cout << ans << endl;
}