#include <bits/stdc++.h>

using namespace std;
bool isPrime(long n)
{
    for(int i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
            return false;
    }
    return true;
}
long getDiv(long n)
{
    long d=0;
    for(int i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
        {
            d=i;
            break;;
        }
    }

    if (d!=0)
        return d;

    return n;
}

 long longestSequence(vector <long> a) {
    long ts=0;
     for(int i=0;i<a.size();i++)
     {
         long s=1;
         if(a[i]==1)
            s=1;
         else if(isPrime(a[i]))
            s = a[i] + 1;
         else
         {
            long div=a[i];
            s = a[i];
             while(div > 1)
             {
                div = div / getDiv(div);
                s = s + div;
             }
         }
         //cout<<"sum"<<s<<endl;
         ts+=s;
     }
     return ts;
}

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