#include <bits/stdc++.h>

#define FORE(i, c) for (const auto& i : (c))
#define FOR(i, j, k) for (int i = (j); i < (k); ++i)
#define REP(i, j) FOR(i, 0, j)
#define ALL(v) begin(v), end(v)
#define mp make_pair
#define pb push_back
#define _1 first
#define _2 second
#define umap unordered_map
#define uset unordered_set
#define vec vector

using namespace std;

typedef long long ll; typedef vec<int> vi; typedef vec<ll> vll; typedef pair<ll, ll> pll;
template <typename T, typename U> inline void amin(T& x, U y) { if (y < x) x = y; }
template <typename T, typename U> inline void amax(T& x, U y) { if (y > x) x = y; }
template <typename C, typename V> inline bool in(const C& c, const V& v) { return c.find(v) != c.end(); }
template <typename T> inline bool in(const vec<T>& v, const T& t) { return find(ALL(v), t) != end(v); }
template <typename T> inline T sq(T t) { return t * t; }

int main() {
    int n;
    cin >> n;
    vll v(n);
    REP(i, n)
        cin >> v[i];
    sort(ALL(v), greater<ll>());
    ll ans = 0;
    REP(i, n)
        ans += (1LL << i) * v[i];
    cout << ans << endl;
    return 0;
}