#include <map>
#include <string>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <cstdio>
#include <queue>
using namespace std;
typedef long long int ll;
using namespace std;



int main() {

    vector<int> primes;
    int use[1000002];
    memset(use,0,sizeof(use));
    for (ll i=2;i<1000002;i++) {
        for (ll j = i*i;j<1000002;j+=i) {
            use[j]=1;
        }
    }
    for (int i = 2; i<1000002; i++) {
        if(use[i]==0) primes.push_back(i);
    }
    
    ll n ;
    cin>>n;
    ll sol = 1 ,all=0;
    ll x ;
    for (int i = 0 ; i<n ; i++) {
        sol =1;
        cin>>x;
        for (int j =0;j<primes.size();j++) {
            while(x%primes[j]==0){
                sol = sol*primes[j]+1;
                x=x/primes[j];
            }
        }
        if(x!=1) sol = (sol*x)+1;
        all +=sol;
    }
     cout<<all<<endl;
    
    return 0;
}