#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long long arr[1000001]={0};
    int i,j;
    arr[1]=1;
    for(i=1;i<1000001;i++)
    {
        for(j=i+i;j<1000001;j+=i)
            arr[j]=max(arr[j],arr[i]*(j/i)+1);
    }
    
   // for(i=0;i<15;i++)
    //    cout<<arr[i]<<" ";
    //cout<<endl;
    
    
    
    long long sum=0;
    for(i=0;i<a.size();i++)
    {
        long long ma=-1;
        if(a[i]<1000001)
            ma=arr[a[i]];
        else
        {
        for(j=1;j<1000001;j++)
        {
            if(a[i]%j==0)
            {
                ma=max(ma,arr[j]*(a[i]/j)+1);
             }
        }
        }
        sum+=ma;
    }
    return sum;

    
}

int main() {
    int n;
    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;
}