#include<bits/stdc++.h>
using namespace std;
#define f(i,a,b) for(int i=a;i<b;i++)
vector<int> v[100005];
int a[100005];
int main(){
    int n,ans=0;
    cin>>n;
    f(i,0,n){
    	cin>>a[i];
	}
	sort(a,a+n);
	f(i,0,n){
		while(a[i]>1){
    		v[i].push_back(a[i]);
    		a[i]=(int)sqrt(a[i]);
		}
		v[i].push_back(1);
	}
	for(int i=n-1;i>=0;i--){
		if(n-i-1>=v[i].size()){
			ans+=1; 
		}
		else{
			ans+=v[i][n-i-1];
		}
	}
	cout<<ans;
	return 0;
}