#include <bits/stdc++.h>
using namespace std;
int n;
struct node{
	int num;
	bool flag;
}a[100010];
bool cmp (node x, node y) {
	return x.num >= y.num;
}
int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++) 
	{
		cin >> a[i].num;
		a[i].flag = 1;
	}
	sort(a + 1, a + n + 1, cmp);
	long long ans = 0;
	for (int i = 1; i <= n; i++)
	{
		ans += a[i].num;
		a[i].flag = 0;
		for (int j = i + 1; j <= n; j++)
		{
			int x = (int)sqrt(a[j].num);
			if (a[j].flag == 1) a[j].num = x;
		}
	}
	cout << ans << endl;
	return 0;
}