//#include <bits/stdc++.h>>
#include <iostream>
#include <cmath>
#include <string>
#include <algorithm>
#include <set>
#include <vector>
#include <map>
#include <list>
#include <stack>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <queue>
#define pt(sth) cout << sth << "\n"
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
typedef long long ll;
typedef pair<ll, ll> pll;
template<class T>bool chmax(T &a, const T &b) {if(a<b) {a=b; return 1;} return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a) {a=b; return 1;} return 0;}
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;
//static const ll MOD=998244353;
//for(i=0;i<N;i++) cin>>a[i];

typedef vector<vector<vector<ll>>> v3D;
typedef vector<vector<ll>> v2D;
typedef vector<ll> v1D;





int main(void) {
  ll i, j, k;
  
  ll N;cin>>N;
  priority_queue<ll> q;
  for(i=0;i<N;i++){
    ll a;cin>>a;
    q.push(a);
  }
  
  ll ans=0;
  for(i=0;i<20;i++){
    ll t=1<<i;
    while(t--){
      if(q.size()==0){
        pt(ans);
        return 0;
      }
      
      ans+=q.top()*i;
      q.pop();
    }
    
    
    
  }
  
  
  
  
  
  
}