#include <bits/stdc++.h>
using namespace std;
int a[100001];
int main()
{
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a[i];
	}
	sort(a + 1, a + n + 1, greater<int>());
	long long ans = 0;
	for (int i = 1; i <= n; i++)
	{
	    ans += a[i];
	    if (a[i] == 1)
	    {
	    	ans += n - i;
	    	break;
		}
		for (int j = i + 1; j <= n && a[j] != 1; j++)	
		{
			a[j] = (int)sqrt(a[j]);
		}
	}
	cout << ans << endl;
	return 0;
}