#include <bits/stdc++.h>

using namespace std;

vector<long> primeFactors(long n)
{
    vector<long> b;
   
    while (n%2 == 0)
    {
        b.push_back(2);
        n = n/2;
    }
 
    for (long i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
            b.push_back(i);
            n = n/i;
        }
    }

    if (n > 2)
        b.push_back(n);
    return b;
}

long longestSequence(vector <long> a) {
    long sum=0;
    for (int i=0;i<a.size();i++){
        vector<long> b=primeFactors(a[i]);
        sum+=a[i];
        for (int j=0;j<b.size();j++){
            //cout<<"sum: "<<sum<<endl;
            a[i]=a[i]/b[j];
            //cout<<"a: "<<a[i]<<endl;
            sum+=a[i];
        }
    }
    return sum;
}

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