#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 +5;

int n, w[N], a[N][30];

int main(){
	cin >>n;
	for (int i = 1; i <= n; i++){
		cin >> w[i];
	}
	
	sort(w + 1, w + n + 1, greater<int>());
	
	for (int i = 1; i <= n; i++){
		a[i][1] = w[i];
		for (int j = 2; j < 30; j ++ ){
			a[i][j] = (int)sqrt(a[i][j - 1]);
		}
	}
	
	int ans = 0;
	for (int i = 1; i <= n; i++){
		if (i >= 30){
			ans += a[i][29];
		}
		else{
			ans += a[i][i];
		}
	}
	
	cout << ans;
	return 0;
}