#include <bits/stdc++.h>
using namespace std;

int n;

int a[100010];

int ans;

bool cmp(int x, int y)
{
	return x > y; 
}

int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	sort(a + 1, a + n + 1, cmp);
	for (int i = 1; i <= n; i++)
	{
		ans += a[i];
		if (i == n) break;
		for (int j = i + 1; j <= n; j++)
		{
			a[j] = (int)sqrt(a[j]);
		}
	}
	cout << ans << endl;
	return 0;
}