#include<bits/stdc++.h>
using namespace std;

vector<int> sieve;
 
void SieveOfEratosthenes(int n)
{
    // Create a boolean array "prime[0..n]" and initialize
    // all entries it as true. A value in prime[i] will
    // finally be false if i is Not a prime, else true.
    bool prime[n+1];
    memset(prime, true, sizeof(prime));
 
    for (int p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (prime[p] == true)
        {
            // Update all multiples of p
            for (int i=p*2; i<=n; i += p)
                prime[i] = false;
        }
    }    
    
    for(int i=2;i<n;i++) {
        if(prime[i])
            sieve.push_back(i);
    }
}
 

/*int sieve[168] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67,
 
 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 
 
151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
 
 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 
 
313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401,
 
 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 
 
491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 
 
599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677,
 
 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 
 
787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881,
 
 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997};*/


long long int calc(long long int a) {
    long long int ans = a;
    int i;
    for(i=0;i<sieve.size();) {
        if(a%sieve[i] == 0) {
            ans = ans + a/sieve[i];
            a = a/sieve[i];
            i = 0;
        }
        else 
            i++;
        if(a == 1)
            break;
    }
    if(i == sieve.size())
        ans++;
    return ans;
}

int main() {  
    SieveOfEratosthenes(1000000);
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  
    long long int ans = 0;
    for(int i=0;i<n;i++) {
        ans = ans + calc(a[i]);
        //cout<<ans<<endl;
    }
    cout<<ans<<endl;
    return 0;
}