//pat A1125 Chain the Ropes(25 分)
//哈夫曼树
#include <cstdio>
#include <cmath>
#include <queue>
#include <algorithm>
using namespace std;
priority_queue<double,vector<double>,greater<double> >q;
int main(){
int n;
double rope;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%lf",&rope);
q.push(rope);
}
double now1,now2,ans;
while(q.size()>1){
now1=q.top();
q.pop();
now2=q.top();
q.pop();
ans=now1+now2;
q.push(ans/2);
}
ans=q.top();
int result=floor(ans);
printf("%d\n",result);
return 0;
}