#include <bits/stdc++.h>
using namespace std;
int n, a[100001], s = 0;
int main (){
	scanf ("%d", &n);
	for (int i = 1;i <= n;i++)
	    scanf ("%d", &a[i]);
	for (int i = 1;i <= n;i++){
		for (int j = 1;j <= 1;j++){
			int maxid = j;
			for (int k = j + 1;k <= n;k++){
				if (a[k] < a[k + 1])
			        maxid = k;
			}
			swap (a[j], a[maxid]);
		}
		s += a[1];
		a[1] = 0;
        for (int j = 2;j <= n;j++){
            a[j] = (int)sqrt(a[j]); 
		}
	}
	printf ("%d", s);
}