#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
 
const int N = 5e6 + 5, MOD = 1e9 + 7;

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