#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 100009;
int n, a[N];
priority_queue<int> que;
void next_day(){
	int size = que.size()-1;
	while(size >= 0){
		int hd = que.top();
		que.pop(); size--;
		hd = (int)sqrt(hd);
		que.push(hd);
//		cout << "proseed hd, new hd = " << hd << '\n';
	}
}
signed main(){
	ios_base :: sync_with_stdio();
	cin.tie(0), cout.tie(0);
	
	int n;
	cin >> n;
	for(int i=1; i<=n; i++){
		cin >> a[i];
		que.push(a[i]);
	}
	int sum = 0;
	while(!que.empty()){ 
		int head = que.top();
		que.pop();
		sum += head;
		next_day();
	}
	cout << sum;
}