#include <bits/stdc++.h>

using namespace std;
#define MAXN 10001
int n;
vector< pair <long,long > > ret;

void factors(long x) {
    long i = 1;
    while(i*i <= x) {
        if(x % i == 0) {
            ret.push_back(make_pair(i,1));
            if(x/i != i) {
                ret.push_back(make_pair(x/i,1));
            }
        }
        i++;
    }
}

long longestSequence(vector <long> a) {
    long res=0;
    //  Return the length of the longest possible sequence of moves.
    for(size_t i = 0; i<a.size();i++){
        long ways = 0 , vsize ;
        if(a[i]==1) {
            res++; continue;
        }
        ret.clear();
        factors(a[i]);
        sort(ret.begin(),ret.end());
        vsize=ret.size();        
        for(long a = vsize-1;a>=0;a--){
            for(long b=0;b<a;b++){
                ret[b].second = max(ret[a].first/ret[b].first*ret[a].second+1,ret[b].second);
            }
        }
       //for(long a=0;a<vsize;a++) cout<<ret[a].first<<" "<<ret[a].second<<endl;
        res+=ret[0].second;
    }
    return res;
}

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