#include <iostream>
#include<algorithm>
#include<iomanip>
#include<string.h>
#include<unordered_map>
#include<map>
#include<cmath>
#include<vector>
#include<iomanip>
#include<queue>
using namespace std;
#define inf 100000000
#define x first
#define y second
#define ll long long
#define ii pair<ll, ll>
#define vi vector<ll>
#define pb push_back
#include<set>
#define mp make_pair
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
vi primes;

ll solve(ll a, ll k){
    if(a==1) return 1;
    ll i, j;
    for(i=k; i>=0; i--){
        if(a%primes[i] == 0) 
        return 1+primes[i]*solve(a/primes[i], i);
    }
    return 1+a;
}

int main() {
    ll n, j, i, result = 0;
                ll temp;
    cin >> n;
                while(n--){
                        primes.clear();
                        cin>>temp;
                    ll a= temp;
            for(i=2; i*i<=a; i++){
        if(a%i==0) primes.pb(i);
    while(a%i==0) a/= i;
    }
        if(a>=2) 
        primes.pb(a);   // There can be only one prime greater than squareroot of a number 
        // eg       102      17 , 2 and 3
        result+= solve(temp, primes.size()-1);        
    }
    cout<<result;
    return 0;
}