#include <iostream>
#include <cmath>
#include <algorithm>
using namespace std;

signed int n;
signed int x[100005];
signed int ans;

bool cmp(int a , int b)
{
	return a > b;
}

void solve()
{
	sort(x + 1 , x + n + 1 , cmp);
	for (int i = 1 ; i <= n ; i ++)
	{
		for (int j = 1 ; j <= i - 1 ; j ++)
		{
			x[i] = (signed int)(sqrt(x[i] * 1.0));
		}
		ans += x[i];
	}
}

signed int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr) , cout.tie(nullptr);
	cin >> n;
	for (int i = 1 ; i <= n ; i ++)
	{
		cin >> x[i];
	}
	solve();
	cout << ans;
	return 0;
}