#include <bits/stdc++.h>
using namespace std;
#define L 1000001
vector < long long > prim;
void init()
{
    vector < int > tmp(L,1);
    long long i,j;
    for (i=2;i<L;i++)
        if (tmp[i])
            for (j=2*i;j<L;j+=i)
                tmp[j]=0;
    for (i=2;i<L;i++)
        if (tmp[i]) prim.push_back(i);
}
bool prime(long long x)
{
    if (x==1||x==2) return false;
    for (long long i=2;i<=sqrt(1.0*x);i++)
        if (x%i==0) return false;
    return true;
}
int main() {  
    long long n,ans=0;
    cin >> n;
    init();
    vector <long long> a(n);
    for (long long i = 0; i < n; i++) {
        cin >> a[i];
        long long tmp=1;
        if (prime(a[i])) tmp+=a[i];
        else
        {
            long long len=0,x=a[i],tag=0;
            while(x!=1)
            {
                if (len==prim.size()) {tag=1;break;}
                while(x%prim[len]==0) {tmp+=x;x=x/prim[len];}
                len++;
            }
            if (tag) tmp+=x;
        }
        ans+=tmp;
    }
    /* Enter your code here. Print output to STDOUT */   
    cout<<ans<<endl;
    return 0;
}