#include <bits/stdc++.h>

using namespace std;

long count(long n)
{
    if( n == 1 )
        return 1;
    long temp = n-1 , max = n+1 , max_temp = -99999999;
    while(temp>1){
        if(n%temp ==0){
            max_temp = 1 + temp*count(n/temp);
            if(max<max_temp)
                max = max_temp;
        }
        temp--;
    }
    return max;
}
long longestSequence(vector <long> a) {
    long int sum = 0;
    for(int i=0 ; i<a.size() ; i++){
        sum += count(a[i]);
    }
    return sum;
    //  Return the length of the longest possible sequence of moves.
}

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