#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    int n;
    int a[50];
    cin >> n;
    for (int i = 1 ; i<=n ; i++) cin >>a[i];
    long res = 0;
    
    for (int i = 1 ; i<n ;i ++)
         for (int j = i +1 ; j<=n;j++)
             if (a[i] < a[j]) { int tg = a[i];a[i]=a[j];a[j] = tg;}
    long tgian = 1;
    for (int i = 1;i<=n ; i++)
    {
        res += (tgian * a[i]);
        tgian *= 2;
    }
    cout << res;
    return 0;
}