#include<bits/stdc++.h>
using namespace std;
int n,ans,t2;
vector<int>a;
int main(){
	cin>>n;
	a.resize(n+2,0);
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a.begin()+1,a.end(),greater<int>());
	for(int i=1;i<=n;i++){
		ans+=a[i];
		int t=i;
		while(t-- && a[i+1]>1)a[i+1]=sqrt(a[i+1]);
		if(a[i+1]==1){
			t2=i;
			break;
		}
	}
	if(t2!=0)ans+=n-t2;
	cout<<ans;
	return 0;
}