#include <bits/stdc++.h>

using namespace std;

long longestSequence(long o) {
    //  Return the length of the longest possible sequence of moves.
    int n=o;
    vector<long> t;
  while (n%2 == 0)
    {
        t.push_back(2);
        n = n/2;
    }
    for (int i = 3; i <= sqrt(n); i = i+2)
    {
        // While i divides n, print i and divide n
        while (n%i == 0)
        {
            t.push_back(i);
            n = n/i;
        }
    }

    // This condition is to handle the case when n
    // is a prime number greater than 2
    if (n > 2)
        t.push_back(n);
    long x;
    x=t.size();
    long sum=o;
    long di=o;
    for(long j=0;j<t.size();j++){
        di=di/t[j];
        sum=sum+di;
    }
    
    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 ans,ak;
    ak=0;
    for(int f=0;f<n;f++){
      ans=  longestSequence(a[f]);
      ak=ak+ans;
    }
    cout<<ak;
    return 0;
}