#include <bits/stdc++.h>

using namespace std;
long long lu[10000001]={0};

long long longestSeq(long n){
if(n==1)
    return 1;
    if(lu[n]==0)
    {
     long i;
    for(i=1;i<n;i++)
    {
        if(n%i == 0 ){
            if(lu[i]==0)
                lu[i]=longestSeq(i);
            if(lu[n] < ((lu[i]*n/i) +1))
            lu[n]=((lu[i]*n/i) +1);
        }
    }
    }
    return lu[n];
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
 long sum=0,i;
    for(i=0;i<a.size();i++)
 {
    sum=sum+ longestSeq(a[i]);
 }
     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;
}