#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    unsigned long total = 0;
    for(int i=0;i<a.size();i++){
        long choco = a[i];
        total += choco;
        long chocoOri = choco;
        while(choco != 1){
            bool divided = false;
            for(int j=choco/2;j>1;j--){
                if(choco % j == 0){
                    divided = true;
                    total += chocoOri / choco;
                    choco /= j;
                    break;
                }
            }
            if(!divided){
                total += chocoOri / choco;
                choco = 1;
            }
        }
        //cout<<chocoOri<<" me dio "<<total<<endl;
    }
    return total;
}

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