#include <bits/stdc++.h>
using namespace std;
int a[100001];
bool cmp(int a1,int b1)
{
	return a1>b1;
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
	}
	sort(a+1,a+n+1,cmp);
	long long ans=0;
	for(int i=1;i<=n;i++)
	{
		int i1=i-1;
		int y=a[i],x=a[i];
		while(i1--)
		{
			y=(int)sqrt(x);
			x=y;
			//cout<<x<<" "<<y<<endl;
		}
		ans+=y;
	}
	cout<<ans<<endl;
	return 0;
}