#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[100005];
int main()
{
	scanf("%lld", &n);
	for (int i = 1; i <= n; ++i) scanf("%lld", &a[i]);
	sort(a + 1, a + n + 1, greater<ll>());
	ll sum = 0;
	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; j <= min(i - 1, 17); ++j)
		{
			a[i] = sqrt(a[i]);
			if (a[i] == 1) break;
		}
		sum += a[i];
	}
	cout << sum << endl;
	return 0;
}