#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
#define MAX 1000005
typedef long long ll;

int main() {  
    vector<ll> primes;
    vector<int> p(MAX, true);
    p[0]=p[1]=false;
    for(ll i=2;i<MAX;i++){
        if(p[i]){
            primes.push_back(i);
            for(ll j=i*i;j<MAX;j+=i)
                p[j]=false;
        }
    }
    
    int n;
    cin >> n;
    int k = primes.size();
    ll x,ans=0;
    for(int i=0;i<n;i++){
        cin>>x;
        ans += x;
        int j=0;
        while(j<k && x!=1){
            if(x%primes[j]==0){
                x/=primes[j];
                ans += x;
            }
            else
                ++j;
        }
        
        if(x!=1)
            ++ans;
    }        
    cout<<ans<<endl;
    return 0;
}