#include <bits/stdc++.h>
//#define int long long 
#define lll int
using namespace std;

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

vector<int> 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));
  vector<int> a;
    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;
        }
    }
 
    // Print all prime numbers
    for (int p=2; p<=n; p++)
       if (prime[p])
       a.push_back(p);   
    return a;
}
 






long longestSequence(vector <long> a) {
   long n=a.size();
    vector<int> p=SieveOfEratosthenes(1000000);
    long i;
    
  //  for(i=0;i<=100;i++) cout<<p[i]<<" ";
    
   

    
    
    long y=0,z=0;
    for(i=0;i<=n-1;i++)
    {
        long x=a[i],w=x;
        
        long j; y=0;   j=0;
        while(p[j]<=x && j<=p.size()-1)
        {
            while(x%p[j]==0)
            {
               y=y+x; x=(long long)x/p[j];
                
            }
            
           j++;
            
            
        }
         //cout<<y<<endl;
        if(x!=1) y=y+x;
        z=z+y+1;
     }
    
    return z;
}

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