#include <bits/stdc++.h>

using namespace std;
unsigned long long int counter=0;
unsigned long long int longestSequence(long m) 
{
    long i,p;
    if(m==1)
    {
        return 0;
    }
    else
    {
    for(i=2;i<=m;i++)
    {
        if(m%i==0)
        {
            p = m/i;
            break;
        }
    }
    
    counter=counter+p+longestSequence(p);
   return counter;
    }
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    unsigned long long int result=0;
    for(int a_i = 0; a_i < n; a_i++){
        counter =0;
       unsigned long long int longest = longestSequence(a[a_i])+a[a_i];
        result+=longest;
    }
    //result+=counter;
    cout << result << endl;
    return 0;
}