#include <iostream>
#include <cstdio>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <cstring>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <cmath>
#include <cassert>
#include <set>
#include <complex>
#include <bitset>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <climits>
#include <string>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;

#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define endl '\n'
#define eps 1e-8
#define io  ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define file freopen ("in.txt", "r", stdin),freopen ("out.txt", "w", stdout);
#define filein freopen ("in.txt", "r", stdin);
#define all(v) ((v).begin()), ((v).end())
#define mid ((st + en) >> 1)

const int N = 45;

int n;
int a[N];

int main(){
	cin >> n;
	for(int i = 0; i < n; i++)
		cin >> a[i];
	sort(a, a + n, greater<int>());
	long long ret = 0;
	for(int i = 0; i < n; i++)
		ret += (1LL << i) * 1LL * a[i];
	cout << ret << endl;
	return 0;

}