#include<iostream>
#include<cmath>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
long long int ans(long long int n);
map<long long int,long long int> m;

int main(){
    m[1]=1;
    int n;
    cin>>n;
    long long int sum=0,a;
    while(n--){
        cin>>a;
       if(!m.count(a))
        sum+=ans(a);
        else sum+=m[a];

    }
   cout<<sum<<endl;
}

long long int ans(long long int n){
     long long int memo[100000];
     vector<long long int> divisors;
     for(long long int i=1;i*i<=n;i++){
         if(n%i==0){
              divisors.push_back(i);
            if(i*i!=n)
              divisors.push_back(n/i);
         }
     }

     sort(divisors.begin(),divisors.end());
     memo[0]=1;
      for(long long int i=1;i<divisors.size();i++){
        if(m.count(divisors[i])){
            memo[i]=m[divisors[i]];
            continue;
        }
        memo[i]=0;
        for(long long int j=0;divisors[j]<divisors[i];j++){
             if(divisors[i]%divisors[j]==0){
                long long int a = (divisors[i]/divisors[j])*memo[j];
                if(1+a>memo[i]) memo[i]=1+a;

            }
        }
        m[divisors[i]]=memo[i];
     }
     return memo[divisors.size()-1];
}