/******************************************
*    AUTHOR:         CHIRAG AGARWAL       *
*    INSTITUITION:   BITS PILANI, PILANI  *
******************************************/
#include <bits/stdc++.h>
using namespace std;
 
typedef long long LL; 
typedef long double LD;

long long arr[43];

int main() 
{
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%lld",&arr[i]);
	}	
	sort(arr+1,arr+n+1);
	long long ans=0;
	for(int i=n;i>=1;i--)
	{
		ans+=(1ll<<(n-i))*1ll*arr[i];
	}
	printf("%lld\n",ans);
	return 0;
}