#include <bits/stdc++.h>
using namespace std;
int n,a[100005];
long long ans=0;
int cmp(int x,int y);
int genhao(int zhi,double p);
int main(){
	
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",a+i);
	}
	sort(a+1,a+n+1,cmp);
	ans=a[1];
	for(int i=2;i<=n;i++){
		ans+=genhao(a[i],pow(2,i-1));
	}
	cout<<ans<<endl;
	return 0;
}

int cmp(int x,int y){
	return x>y;
}

int genhao(int zhi,double p){
	int l=1,r=zhi;
	while(r-l>1){
		int mid=(l+r)/2;
		double d=pow(mid,p);
		//cout<<d<<endl;
		if(d==zhi) return mid;
		else if(d<zhi){
			l=mid;
		}else{
			r=mid;
		}
		//cout<<l<<" "<<r<<endl;
	}
	return l;
}