#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    int len=a.size();
    int max = 0;
    for(int i=0;i<len;i++)
    {
        if(a[i]>max)
            max =a[i];
    }

    int arr[max];
    arr[0]=1;

    int result = 0,ans;
    for(int j=1;j<max;j++)
    {
        result = 0;
        for(int k=1;k<=j;k++)
        {
            if((j+1)%k==0)
            {
                ans = 1 + ((j+1)/k)*arr[k-1];
                if(ans > result)
                    result = ans;
            }
        }
        arr[j]=result;
    }

    int value = 0;

    for(int i=0;i<len;i++)
    {
        value+=arr[a[i]-1];
    }
    return value;

}

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;
}