#include <bits/stdc++.h>

using namespace std;

bool comp(int i, int j) { return i > j; }

long long int longestSequence(vector <long long int> v) {
    long long int fin = 0;
    for(long long int i=0;i<v.size();i++){
        long long int num = v[i];
        vector<long long int > primes;
        while(v[i]%2==0){
            primes.push_back(2);
            v[i] = v[i]/2;
        }
        for(long long int j=3;j<=num/2;j++){
            while(v[i]%j==0){
                primes.push_back(j);
                v[i] = v[i]/j;
            }
        }
        long long int ans = 1,sum=0;
        if(primes.size()>0){
            sort(primes.begin(), primes.end(), comp);
            for(long long int j=0;j<primes.size();j++){
                ans = ans*primes[j];
                sum += ans;
            }
            sum++;
            primes.clear();
        }
        else if(primes.size()==0){
            if(num!=1){sum = num + 1;}
            else{sum = 1;}
        }
        fin += sum;
    }
    return fin;
}

int main() {
    int n;
    cin >> n;
    vector<long long int> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    longestSequence(a);
    cout << result << endl;
    return 0;
}