#include<bits/stdc++.h>
using namespace std;
//int y = (int)sqrt(x);
//#define int long long
#define f(i,a,b) for(int i=a;i<b;i++)
#define r(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back
#define mp make_pair
typedef long long ll;
void solve(){
	int n;
	cin>>n;
	vector<int> v(n);
	for(int i=0;i<n;i++){
		cin>>v[i];
	}int ans=0;
	while(!v.empty()){
		sort(v.begin(),v.end());
		reverse(v.begin(),v.end());
		ans+=v[0];
		v.erase(v.begin());
		for(int i=0;i<(int)v.size();i++){
			int y = (int)sqrt(v[i]);
			//cout<<y<<' '; //d
			v[i]=y;
		}//cout<<ans<<"\n";//d
	}
	cout<<ans<<'\n';
}
signed main(){
	int T=1;
	//cin>>T;
	while(T--)solve();
	return 0;
}