#include <iostream>
#include <cmath>
#include <complex>
#include <vector>
#include <algorithm>
#include <map>
#include <cstring>
#include <set>
#include <iomanip>
#include <functional>
#include <iterator>
#include <numeric>
#include <queue>

const double PI(acos(-1.0));
const double PI_2 = PI * 2.0;
double eps = 1e-9;

#define pb push_back
#define mp(a,b) make_pair(a,b)
#define all(x) x.begin(), x.end()
#define sqr(x) ((x)*(x))
#define F first
#define S second
#define inf (ll)(1e9+7)
#define infll (ll)(1e18+3)
#define sz(x) ((ll)x.size())
#define bits(x) __builtin_popcount(x)
#define bitsl(x) __builtin_popcountll(x)
#define rep(i, a, b) for (ll (i) = (a); i <= (b); ++(i))
#define forn(i, n) rep(i, 0, ((ll)n)-1)
#define INF 200000
#define rz resize

using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef vector < ll > vll;
typedef vector<ll> vi;
typedef pair < ll, ll > pll;
typedef pair < ll, ll > pii;
typedef vector<vi> vii;
typedef vector<vi> vvi;
typedef vector<ull> vull;

int main() {
    int n;
    cin >> n;
    ll p = 1, s = 0;
    vi v(n);
    forn(i, n) { cin >> v[i]; }
    sort(all(v));
    reverse(all(v));
    forn(i, n){
        s += v[i]*p;
        p*=2;
    }
    cout << s << endl;
    return 0;
}