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

int i, n, s, a[100005];

int main()
{
	cin >> n;
	for (i = 0; i < n; i++)
		cin >> a[i];
	sort(a, a + n);
	while(n--)
	{
		s += a[n];
		if (a[n - 1] == 1)
		{
			s += n;
			break; 
		}
		for (i = n; i >= 0; i--)
			if (a[i] == 1)
				continue;
			else
				a[i] = (int)sqrt(a[i]);
	}
	cout << s;
	return 0;
}