#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dbl;

int n, ans;
int a[100005];

int root(int x){
	int S = sqrt(x);
	for (S = max(0, S - 3); S * S <= x; S++);
	return S-1;
}

int main(){
	scanf("%d", &n);
	for (int i = 0; i < n; i++) scanf("%d", a+i);
	sort(a, a+n, greater<int>());
	for (int i = 0; i < n; i++){
		for (int j = 0; j < i && j <= 5; j++) a[i] = root(a[i]);
		ans += a[i];
	}
	printf("%d\n", ans);
	return 0;
}