#include <bits/stdc++.h>
#define ll long long
using namespace std;
bool isPrime(ll 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 (ll i=5; i*i<=n; i=i+6)
        if (n%i == 0 || n%(i+2) == 0)
           return false;
 
    return true;
}
ll divisors(ll n)
{
    ll sum=n;
    if(isPrime(n))
        return sum+1;
    /*for (int i=1; i<=sqrt(n); i++)
    {
        if (n%i==0)
        {
            if (n/i == i){ // check if divisors are equal
                sum+=i;
            //cout<<sum<<"a ";
            }
            else
            {
               sum+=(n/i);
               //cout<<sum<<"b ";
            }
        }
        //cout<<sum<<" ";
    }
    sum-=2;*/
    else{
    ll i=3;
    while(n>1){
        if(isPrime(n))
        return sum+1;
        else
        while(n%2==0&&n!=1){
            //if(isPrime(n))
        //return sum+1;
            sum+=n/2;
            n=n/2;
           //cout<<sum<<" ";
        }
         if(n>=i){
        while((n%i!=0) && i*i < n){
            i+=2;
        }
        while(n%i==0&&n!=1){
            if(isPrime(n))
        return sum+1;
            sum+=n/i;
            n=n/i;
           //cout<<sum<<" ";
        }
        //if(n>=i)
       // i++;
         }
        else {
            //sum+=1;
            break;
        }
    }
    }
  //  cout<<endl;
    return sum;
}
ll longestSequence(vector <long> a) {
    ll sum=0;
    for(int i=0;i<a.size();i++)
    {
        sum+=divisors(a[i]);
    }
    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 result = longestSequence(a);
    cout << result << endl;
    return 0;
}