#include <iostream>
#include<vector>
#include<algorithm>

using namespace std;

long longestSequence(vector <long> &a)
{
    int m = a[0];
    for(int i = 0; i < a.size(); i++)
        if(m<a[i])
        {
         //   cout << m << endl;
            m=a[i];
        }
    long long int dp[m+1];
    dp[0] = 0;
    dp[1] = 1;
    for(int i = 2; i <= m; i++)
    {
        dp[i] = i+1;
        for(int j = 1; j < i; j++)
            if(i%j == 0)
                dp[i] = max(dp[i], dp[j]*(i/j)+1);
       // cout << "dp[" << i << "] = " << dp[i] << endl;
    }
    long ans = 0L;
    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];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}