#include <iostream>
#include <iterator>
#include <algorithm>
#include <numeric>
#include <utility>
#include <vector>
#include <set>
#include <unordered_set>
#include <cstdio>
#include <cstring>

#define CE constexpr
#define ISITER(T) istream_iterator<T>(cin)
#define OSITER(T) ostream_iterator<T>(cout)
#define USET unordered_set

using namespace std;

using LLI = long long int;
using ULLI = unsigned long long int;

CE int max_N = 40;
int C[max_N];
int N;

void
solve ()
{
    LLI ans = 0;
    for(LLI i = 0;i < N;++i)
        ans += (((LLI)1<<i) * C[i]);
    cout << ans << endl;
}

int
main ()
{
    cin >> N;
    copy_n(ISITER(int) , N , C);
    sort(C , C+N , [](int a , int b){return a > b;});
    solve();
    return 0;
}