/*
 * ex1.cpp
 *
 *  Created on: 14 feb 2017
 *      Author: nicolapellicano
 */
#include <iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <math.h>
#include <algorithm>
#include <memory.h>

using namespace std;

#define FILL(a, val) memset((a), (val), sizeof(a));

bool myfunction (int i,int j) { return (i>j); }

int main(int argc, char **argv) {
	ios_base::sync_with_stdio(false);
	int T;
	scanf("%d",&T);
	vector<int> c(T);
	for (int k = 0; k < T; ++k) {
		scanf("%d",&c[k]);
	}
	sort(c.begin(),c.end(),myfunction);

	long res=0;
	for (int i = 0; i < T; ++i) {
		res+=c[i]*pow(2,i);
	}
	cout << res << endl;

}