#include <bits/stdc++.h>
#define pll pair<long long, long long>
#define st first
#define nd second

using namespace std;

long long n;
long long a[105], res=0, c;

long long isPrime(long long x, long long start){
    long long root = sqrt(x);
    if(x==1) return 1;
    if(x==2) return -1;
    for(long long i=start;i<=root;i++){
        if(x%i==0) return i;
    }
    return -1;
}

long long mypow(long long p, long long x){
    if(x==1) return p;
    if(x==2) return p*p;
    long long tmp = mypow(p, x>>1);
    if(x%2==0) return tmp*tmp;
    return tmp*tmp*p;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i=1;i<=n;i++) cin>>a[i];
    for(int i=1;i<=n;i++){
        long long tmp = a[i];
        long long j = 2LL;
        if (isPrime(tmp, 2)==-1) {
            res += tmp+1LL;
        } else {
            stack<pll> ss;
            while(tmp!=1) {
            //cout<<tmp<<" tmpj "<<j<<endl;
                if(tmp%j==0) {
                    tmp /= j;
                    if (ss.empty()){
                        ss.push(make_pair(j, 1LL));
                    } else {
                        if(ss.top().st==j) ss.top().nd++;
                        else ss.push(make_pair(j, 1LL));
                    }
                } else {
                    c = isPrime(tmp, j);
                    if(c==-1){
                        if(ss.top().st==tmp) ss.top().nd++;
                        else ss.push(make_pair(tmp, 1LL));
                        tmp = 1LL;
                    } else j = c;
                }
            }
            long long mul = 1LL;
            while(!ss.empty()) {
                long long p = ss.top().st, x = ss.top().nd;
                long long px = mypow(p, x);
                long long sumcsn = p*(px-1LL)/(p-1LL);
                //cout<<ss.top().st<<" "<<ss.top().nd<<endl;
                //cout<<"sumcsn "<<sumcsn<<endl;
                res += mul*sumcsn;
                mul *= px;
                ss.pop();
            }
            res++;
        }
    }
    cout << res << endl;
    return 0;
}