#include <bits/stdc++.h>
using namespace std;
int n, a[10005], s;
bool cmp (int a, int b){
	return a > b;
}
int main (){
	scanf ("%d", &n);
	for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
	sort (a + 1, a + n + 1, cmp);
	for (int i = 1; i <= n; i++){
		s += a[i];
		for (int j = i + 1; j <= n; j++)
			a[j] = int(sqrt(a[j]));
	}
	printf ("%d", s);
	return 0;
}