#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1000001;
ll moves[N];

ll getmoves(ll x, vector<ll> div, int l){
    if(x<N) return moves[x];
    return getmoves(x/div[l-1],div,l-1)*div[l-1] + 1;
}

int main() {
    memset(moves, 0, sizeof moves);
    moves[1] = 1;
    for(ll i=1;i<N;i++){
        for(ll j=2*i;j<N;j+=i){
            moves[j] = max(moves[i]*(j/i)+1, moves[j]);
        }
    }
    int n;
    scanf("%d",&n);
    ll a, res=0, sq, tmp;
    vector<ll> div;
    while(n--){
        scanf("%lld",&a);
        tmp = a;
        while(a%2==0){
            div.push_back(2);
            a/=2;
        }
        sq = sqrt(a);
        for(ll i=3;i<=sq;i+=2){
            while(a%i==0){
                div.push_back(i);
                a/=i;
            }
        }
        if(a>2) div.push_back(a);
        res+=getmoves(tmp, div, div.size());
        div.clear();
    }
    printf("%lld",res);
    return 0;
}