#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define f(i, x, n) for(int i = x; i < (int)(n); ++i)

int x[40];

int main(){
	int n;
	scanf("%d", &n);
	f(i, 0, n)scanf("%d", x + i);
	sort(x, x + n);
	reverse(x, x + n);
	ll an = 0;
	f(i, 0, n)an += (1ll << i) * x[i];
	printf("%lld\n", an);
}