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

int n,a[100010];
bool cmp(int a,int b)
{
	return a > b;
}

void solve()
{
	int sum = 0;
	cin >> n;
	for (int i = 1;i <= n;i++)
		cin >> a[i];
	sort(a+1,a+n+1,cmp);
	for (int i = 1;i <= min(n,10);i++)
	{
		sum += a[i];
		for (int j = i+1;j <= n;j++)
			a[j] = (int)(sqrt(a[j]));
	}
	cout << sum + max(0,n-10);
}

int main()
{
	solve();
	return 0;
}
//rp++
//13:38