#pragma comment(linker, ”/STACK:38777216“
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cassert>
#include <cstdio>
#include <stack>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <time.h>
#include <map>
#include <set>

using namespace std;

const int N = 45;
const int inf = 1000 * 1000 * 1000;
const int mod = 1000 * 1000 * 1000 + 7;

int n;
long long a[N];
long long answ;

int main(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>a[i];
    sort(a+1,a+n+1);
    long long t = 1ll;
    for(int i=n;i>=1;i--){
        answ += a[i] * t;
        t *= 2ll;
    }
    cout<<answ<<endl;
	return 0;
}
/*
9
5 2
5 3
5 4
4 8
8 9
3 1
1 6
1 7
*/