#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <cstring>
#include <map>
#include <cstdlib>
#include <ctime>
#include <cassert>
#include <bitset>
#define f first
#define s second
#define ll long long
#define ull unsigned long long
#define mp make_pair
#define pb push_back
#define vi vector <int>
#define ld long double
#define pii pair<int, int>
#define y1 sda
using namespace std;    
const int N = int(3e5), mod = int(1e9)  + 7;

int n, c[N];

ll ans; 

int main () {
	cin >> n;
	for(int j = 0; j < n; j++){
		cin >> c[j];
	}
	sort(c, c + n);
	reverse(c,c + n);
	for(int j = 0; j < n; j++){
		ans += (1ll << j) * c[j];
	}
	cout << ans;


return 0;
}