#include <bits/stdc++.h>
#define P(X) printf("db %d\n",X);
#define ll long long
#define pii pair<int,int>
#define x first
#define y second
#define pb push_back
#define rep(i,n) for(i=1;i<=n;i++)
#define FO freopen("t.txt","w",stdout);
using namespace std;
ll a[1000001];
int sz;
vector<ll>pr;
void siv()
{
    pr.push_back(2);
    int i,j;
    for(i=3;i<1000;i+=2){
        if(!a[i]){
            pr.push_back(i);
            for(j=i*i;j<1000000;j+=2*i) a[j]=1;
        }
    }
    for(i=1001;i<1000000;i+=2)
        if(!a[i])   pr.push_back(i);
}
ll sol(ll n)
{
    int i=0;
    if(n==1)    return 1;
    ll m=n,s=n;
    while(pr[i]*pr[i]<=m&&i<sz){
        while(m%pr[i]==0){
            m/=pr[i];
            s+=m;
        }
        i++;
    }
    if(m>1) s++;
    return s;
}
int main()
{
  //  freopen("test.txt","r",stdin);
    siv();
    sz=pr.size();
    ll i,j,ts,cn=0,n,s=0;
    scanf("%lld",&ts);
    while(ts--){
    	scanf("%lld",&n);
    	s+=sol(n);
    }
    printf("%lld\n",s);
    return 0;
}