#include <bits/stdc++.h>

using namespace std;
int dp[101];
long longestSequence(vector <long> a) {
    long ans=0;
    
    for(int i=0;i<a.size();i++)
        ans+=dp[a[i]];
    return ans;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    memset(dp,0,sizeof(dp));
    
    dp[0]=0;
    dp[1]=1;
    dp[2]=3;
    
    
    for(int i=3;i<=100;i++){
        
        for(int j=1;j<i;j++){
            
            if(i%j!=0)
                continue;
            
            dp[i]= max(dp[i],1 + (i/j)*dp[j]);
            if(i==3){
               // cout<<dp[i]<<" ";
            }   
        }
        
        
    }
    
    
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}