#include<bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
long long a[N];
bool cmp(int a, int b){
	return a > b;
}
int main(){
	cin.tie(0);
	cout.tie(0);
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++){
		cin>> a[i];
	}
	sort(a+1,a+1+n,cmp);
	long long sum = 0;
	for(int i = 1; i <= n; i++){
		int f = i-1;
		while(f){
			a[i] = sqrt(a[i]);
			f--;
		}
		
		sum += a[i];
	}
	cout << sum;
	return 0;
}