#include<iostream>
#include<queue>
#include<cmath>
#define int long long
using namespace std;
int n,x;
priority_queue<int>que;
signed main(){
	cin>>n;
	int cnt=0;
	for(int i = 1;i <= n;i++){
		cin>>x;
		que.push(x);
	}
	for(int i = 1;i <= n;i++){
		int tmp=que.top();
		que.pop();
		if(i>=50) cnt+=1;
		for(int j = 1;j < i;j++){
			tmp=(int)sqrt(tmp);
		}
		cnt+=tmp;
	}
	cout<<cnt;
	return 0;
}