#include<bits/stdc++.h>
using namespace std;
const long long size = 1000001;
vector<long long >isprime(size , true);
vector<long long >prime;
vector<long long >SPF(size);
vector<long long >MPF(size);
void sieve()
{
    isprime[0] = isprime[1] = false ;
    for (long long int i=2; i<size ; i++)
    {
        if (isprime[i])
        {
            prime.push_back(i);
            SPF[i] = i;
            MPF[i]=i;
        }
        for (long long int j=0;j < (int)prime.size() && i*prime[j] < size && prime[j] <= SPF[i];j++)
        {
            isprime[i*prime[j]]=false;
            SPF[i*prime[j]] = prime[j] ;
             MPF[i*prime[j]] = MPF[i] ;
        }
    }
}
long long mpf(long long x)
{
    int i=0;
    while(i!=prime.size())
    {
        if(x%prime[i]!=0)
            i++;
        else
        {
              x/=prime[i];
            if(x<size)
            {
                x=MPF[x];
                break;
            }
        }
    }
    return x;
}
long long cal(long long x)
{
    if(x==1)
        return 1;
    if(x<size)
        return 1+MPF[x]*cal(x/MPF[x]);
       return 1+mpf(x)*cal(x/mpf(x));
     }
int main() {  
    int n;
    cin >> n;
    long long sum=0;
     sieve();
    for (int i = 0; i < n; i++)
    {   
        long long x;
        cin >> x;
        sum+=cal(x);
    }    
    cout<<sum<<endl;
  return 0;
}