#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define lli long long
int main() {  
    int n;
    cin >> n;
  
    vector <lli> a(n);
    lli ans = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        ans+=a[i];
    }
    
    vector<lli> primes;
    bool is_prime[1000100];
    for(lli i=2;i<1000100;++i) is_prime[i] = true;
    for(lli i=2;i<1000100;++i){
        if(is_prime[i]){
            primes.push_back(i);
            //if(i>999000)
             //   cout<<i<<endl;
            for(lli j=2*i;j<1000100;j+=i){
                is_prime[j] = false;
            } 
        }
    }
    for(lli i=0;i<n;++i){
        if(a[i]==1){
            
            continue;
        }
        for(lli j=0;j<primes.size();j++){
            if(a[i]%primes[j]==0){
                ans+=a[i]/primes[j];
                a[i] = a[i]/primes[j];
                //cout<<a[i]<<endl;
                j--;
            }
        }
       if(a[i]>1000990){
           ans+=1;
        }
        
        
    }
    /* Enter your code here. Print output to STDOUT */   
    cout<<ans<<endl;
    return 0;
}