#include <bits/stdc++.h>

using namespace std;
bool isPrime(int n)
{
    // Corner cases
    if (n <= 1)  return false;
    if (n <= 3)  return true;
 
    // This is checked so that we can skip 
    // middle five numbers in below loop
    if (n%2 == 0 || n%3 == 0) return false;
 
    for (int i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;
 
    return true;
}
int GetNextPrime(int n)
{
    //bool isPrime = false;
    int i = n+1;
    for (; i < 2 * n; ++i)
    {
        if(isPrime(i)==true)
            return i;
    }
    return -1;
}
long longestSequence(vector <long> a) {
    long tot_moves=0l;
    for(int i=0;i<a.size();i++)
    {
        tot_moves+=a[i];
        long temp=a[i]; 
        int prime=2;
        while(temp!=1)
        {
            if(temp%prime==0)
            {
                temp=temp/prime;
                tot_moves+=temp;
            }
            else
            {
                prime=GetNextPrime(prime);
            }
        }
        
    }
    return tot_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;
}