#include <bits/stdc++.h>
using namespace std;

int main(){
	long long faln;
	cin >> faln;
	const int n = faln;
	long long lister[n];
	
	for (int x = 0;x<n;x++){
	cin >> lister[x];
	}
	int sum = 0;
	while (true){
	
		int isall = true;


			int max = 0;
			int maxindex = 0;
			for (int x = 0;x<n;x++){
				if (lister[x] > max){
					isall = false;
					max = lister[x];
					maxindex = x;
				}
			}
			sum += max;
			lister[maxindex] = -1;
			for (int x = 0;x<n;x++){
				
				if (lister[x] != -1){
					lister[x] = sqrt(lister[x]);
				}
			}
			
			if (isall){
				break;
			}
		
	
		
	}
	cout << sum << endl;
	return 0;
	
}