#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define LL long long
using namespace std;
LL k,primenum[1000009];
void SieveOfEratosthenes(LL n)
{
    bool prime[n+1];
    memset(prime, true, sizeof(prime));
    for (LL p=2; p*p<=n; p++)
    {
        if (prime[p] == true)
        {
            for (LL i=p*p; i<=n; i += p)
                prime[i] = false;
        }
    }
    k=0;
    for (LL p=2; p<=n; p++)
    {
       if (prime[p])
       {
          primenum[k]=p;
          k++;
       }
    }
}
LL answer(LL n)
{
    LL u=0,primefactors[100009];
    LL x=n,i,sum,nodes;
    for(i=0;i<k;i++)
    {
        if(primenum[i]>sqrt(n))
            break;
        if(x%primenum[i]==0)
        {
            while(x%primenum[i]==0)
            {
                primefactors[u]=primenum[i];
                x/=primenum[i];
                u++;
            }
        }
    }
    if(x!=1)
    {
        primefactors[u]=x;
        u++;
    }
    x=n;
    sum=0;
    nodes=1;
    for(i=u-1;i>=0;i--)
    {
       // cout<<primefactors[i]<<" ";
        sum+=nodes;
        nodes=nodes*primefactors[i];
    }
    //cout<<endl;
    return sum+n;
}
int main() {  
    LL n;
    cin >> n;
    LL a[n+4];
    LL sum=0;
    SieveOfEratosthenes(100009);
    for (LL i = 0; i < n; i++) {
        cin >> a[i];
        sum+=answer(a[i]);
    }
    cout<<sum<<endl;
    return 0;
}