#include <bits/stdc++.h>
using namespace std;
long long a[100005];
int n;
void d() {
	for (int i = 1; i <= n; i++) {
		a[i] = floor(sqrt(a[i]));
	}
}
int main() 
{
	long long sum = 0;
	cin >>n;
	for (int i  = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a+1,a+n+1);
	
	for (int i = n; i >= 1; i--)  {
		sum += a[i];
		d();
	}
	cout << sum;
	
	return 0;
}