#include <bits/stdc++.h>
using namespace std;
int a[100010];
int pfg(int n)
{
	for (int i = 1;i<=n;i++)
	{
		if (n<i*i)
		{
			return i-1;
		}
	}
	return 1; 
}
int main()
{
	int n;
	cin>>n;
	for (int i = 1;i<=n;i++)
	{
		cin>>a[i];
	}
	sort(a+1,a+n+1);
	int z = 0;
	for (int i = n;i>=1;i--)
	{
		z += a[i];
		for (int j = n;j>=1;j--)
		{
			a[j] = pfg(a[j]);
		}
	}
	cout<<z;
	return 0;
}