#include <bits/stdc++.h>

using namespace std;

vector<int> primeFactors(int n)
{
  vector<int> v;
    while (n%2 == 0)
    {  
        v.push_back(2);
        n = n/2;
    }
 
    // n must be odd at this point.  So we can skip 
    // one element (Note i = i +2)
    for (int i = 3; i <= sqrt(n); i = i+2)
    {
        // While i divides n, print i and divide n
        while (n%i == 0)
        {
            v.push_back(i);
            
            n = n/i;
        }
    }
 
    
    
    if (n > 2)
    {
       
        v.push_back(n);
    }   
    sort(v.begin(),v.end());
    return v;
}
long longestSequence(long n) {
   vector<int> V;
   V=primeFactors(n);
   long total=1;
   for(int i=0;i<V.size();i++)
   {
       long x=V.at(i);
       long temp=n/x;
       total=total+temp;
   }
   return total; //  Return the length of the longest possible sequence of moves.
}

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