#include<bits/stdc++.h>
using namespace std;
#define int long long
int read(){
	int x=0;
	char c=getchar();
	char f=1;
	while(!isdigit(c)){
		f&=(x!='-');
		c=getchar();
	}
	while(isdigit(c)){
		x=(x<<1)+(x<<3)+(c^48);
		c=getchar();
	}
	x=f?x:-x;
	return x;
}
const int N=1e5+5;
int n,ans;
struct node{
	int val, id,sq;
}a[N];
bool cmp(node a,node b){
	return a.sq!=b.sq?a.sq>b.sq:a.val>b.val;
}
signed main(){
	n=read();
	for(int i=1;i<=n;i++){
		a[i].val=read();
		a[i].id=i;
		a[i].sq=a[i].val;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n-i+1;j++){
			a[j].sq=sqrt(a[j].val);
		}
		sort(a+1,a+n-i+2,cmp);
		ans+=a[1].val;
		a[1].val=a[1].sq=-1;
		for(int j=2;j<=n-i+1;j++){
			a[j].val=a[j].sq;
		}
		sort(a+1,a+n-i+2,cmp);
	}
	cout<<ans;
}