#include<bits/stdc++.h>

using namespace std;

#define sz(x) (int)(x.size())
#define pb(x) push_back(x) 
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int Mod1 = 998244353;
const int Mod2 = 1e9 + 7;

int n;
ll a[100010], ans = 0;
bool cmp(const ll &A, const ll &B){
	return A > B;
}

int main(){
	scanf("%d", &n);
	for(int i = 1; i <= n; i++){
		scanf("%lld", &a[i]); 
	}
	sort(a + 1, a + n + 1, cmp);
	for(int i = 1; i <= n; i++){
		ans += a[i];
		for(int j = i + 1; j <= n; j++){
			a[j] = (ll)floor(sqrt((double)a[j]));
			if(a[j] == 0){
				break;
			}
		}
	}
	printf("%lld", ans);
	return 0;
}