#include <bits/stdc++.h>

using namespace std;

long longestSequence(long a[],int n) {
   long count=0,sum=0,j=2; int i=0,k;
    while(i<n)
    {long m=sqrt(a[i]);
        while(a[i]!=0&&j<=m)
        { 
        if(a[i]%j==0)
		{
		count+=a[i];
		a[i]=a[i]/j;
		}
		else /*if(a[i]==1)
		{
			count+=1;
			break;
		}
		else*/
		j++;
		
		}
		if(a[i]==1)
		sum+=1;
		else if(j>m)
		sum+=a[i]+1;
		 sum+=count;  
		 count=0;  j=2;
         i++;
    }
    return sum;
}

int main() {
    int n;
    cin >> n;
    long a[n];
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a,n);
    cout << result << endl;
    return 0;
}