#include <bits/stdc++.h>
#define ll  long long

using namespace std;
const int maxn=trunc(1e6)+10;
int p[maxn+1],cc[maxn+1],nn=0; ll sum;
void sangso() {
    int max1=trunc(1e6);
    for (int i=2; i<=trunc(sqrt(max1)) ; i++ ) if (p[i]==0 ) {
            for (int j=i*i;j<=max1 ; j+=i) {
                p[j]=1;
            }
    }
    for (int i=2;i<=max1;i++) if (p[i]==0) cc[++nn]=i;
}
void pt(ll x ) {
    ll kq=1,dem=1;
    int c[10000],mm=0;
    memset(c,0,sizeof(c));
    for (int i=1;i<=nn ; i++) {
        if (x==1) break;
        dem=1;
        while (x%cc[i]==0) {
            x/=cc[i];
            c[++mm]=cc[i];
        }
    }
    ll t=1;
    for (int i=mm ; i>=1 ; i--) {
        t*=c[i];
        kq=kq+t;
    }
    sum+=kq;
}
int main()
{
    int n;ll x1 ;
    cin>>n;
    sum=0;
    sangso();
    while (n-->0)  {
            cin>>x1;
           /* if (x1==1) {sum+=1; continue;}
            if (x1%2==1) sum=sum+x1+1;
            else*/ pt(x1);
    }
    cout<<sum;
    return 0;
}