#include <iostream>
#include <cassert>
#include <vector>
#include <map>
#include <set>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <math.h>
#include <unordered_map>
#define MAXN 300000
#define ll long long
#define MODD 1000000000
using namespace std;



ll dp[111111];
ll divs[111111];

unordered_map<ll,ll> hashed;

ll Solve(ll x)
{
    int nd=0;
    for(ll d=1;d*d<=x;d++) {
        if (x%d!=0)
            continue;
        divs[nd++]=d;
        if (d*d != x)
            divs[nd++]=x/d;
    }
    
    sort(divs,divs+nd);
    for(int i=0;i<nd;i++)
        dp[i]=1;
    for(int i=1;i<nd;i++) {
        if (hashed.find(divs[i]) != hashed.end()) {
            dp[i]=hashed[divs[i]];
            continue;
        }
        
        dp[i]=1;
        for(int j=0;j<i;j++) {
            if (divs[i]%divs[j]==0) {
                dp[i]=max(dp[i],1+(divs[i]/divs[j])*dp[j]);
            }
        }
        hashed[divs[i]]=dp[i];
    }
    
    return dp[nd-1];
    
    
}

int main() {
    
    

    int n;
    cin>>n;
    ll ans = 0;
    for(int i=1;i<=n;i++) {
        ll x;
        cin>>x;
        ans += Solve(x);
    }
    cout << ans << endl;
    
    
}