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

int x[10005], y[10005];

int main()
{
	int n, jsq = 0, maxn = INT_MIN;
	cin >> n;
	maxn = x[1];
	for (int i = 1; i <= n; i++)
	{
		cin >> x[i];
	}
	for (int i = 1; i <= n; i++)
	{
		if (x[i] > maxn)
		{
			maxn = x[i];
			jsq += maxn;
			maxn = 0;
		}
	}
	for (int i = 1; i <= n; i++)
	{
		y[i] = sqrt(x[i]); 
	}
	maxn = y[1];
	for (int i = 1; i <= n; i++)
	{
		if (y[i] > maxn)
		{
			jsq += y[i];
			y[i] = 0;
			y[i] = sqrt(x[i]);
			maxn = 0;
		}
	} 
	cout << jsq << endl;
	return 0;
}