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

int n, a[100005], cnt, sum;

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

int main()
{
	scanf("%d", &n);
	for(int i = 1; i <= n; i++) scanf("%d", &a[i]);
	sort(a + 1, a + n + 1, cmp);
	for(int i = 1; i <= n; i++)
	{
		//for(int j = 1; j <= n - (n - i + 1); j++) cnt++;
		for(int j = 1; j <= n - (n - i + 1); j++) 
		{
			if(a[i] == 1) break;
			a[i] = int(sqrt(a[i]));
		}
		sum += a[i];
	} 
	printf("%d", sum);
	//cout << cnt << endl;
	return 0;
 }