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


int main() {
    int n;
    long long res = 0;
    vector <int> vec;
  
    cin >> n;
  
    for (int i=1; i<=n; ++i) {
      int a;
      cin >> a;
      vec.push_back (a);
    }
  
    sort (vec.begin(), vec.end());
    reverse (vec.begin(), vec.end());
  
    for (long long i=0; i<vec.size(); ++i) 
       res += (1LL << i) * vec[i];

    cout << res;
  
    return 0;
}