#include<bits/stdc++.h>
using namespace std;

#define ll long long
#define sp ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
#define mp make_pair
#define cps CLOCKS_PER_SEC
#define mod (ll)1000000007
#define f first
#define s second
#define debug1(x) cout<<x<<"\n"
#define debug2(x,y) cout<<x<<" "<<y<<"\n"
#define debug3(x,y,z) cout<<x<<" "<<y<<" "<<z<<"\n"
#define nl cout<<"\n";
#define priority_queue pq
#define inf (ll)1e15
#define test cout<<"abcd\n";
#define pi pair<int,int>
#define pii pair<int,pi>
#define pb push_back
#define mxn 1000005
vector<ll> a(mxn);
vector<bool> b(mxn);
void sieve(){
    b[0]=b[1]=1;
for(int i=4; i<mxn; i+=2) b[i]=1;
for(int i=3; i*i<mxn; i+=2){
    if(!b[i]){
    for(int j=i*i; j<mxn; j+=2*i)
    b[j]=1;
    }
}
}

void pre(){
    sieve();
a[1]=1;
ll i=2LL;
while(i<mxn){
    a[i]=i+i-1;
    i<<=1LL;
}
a[3]=4;
a[4]=7;
for(int i=2; i<mxn; ++i){
        if(!b[i])
        a[i]=i+1;
    for(int j=i+i; j<mxn; j+=i)
        a[j]=max(a[j],1+(j/i)*a[i]);
}
}

ll mulmod(ll a,ll b,ll m){
ll r=0;
a=a%m;
while(b){
    if(b&1)
        r=(r+a)%m;
    a=(a*2)%m;
    b=b>>1;
}
return r;
}
ll modexp(ll x,ll n,ll m){
ll r=1;
while(n){
    if(n&1)
        r=mulmod(r,x,m);
    x=mulmod(x,x,m);
    n=n>>1;
}
return r;
}
bool millerrabin(ll d,ll n){
    ll a=1+rand()%(n-1);
    ll x=modexp(a,d,n);
    if(x==1||x==n-1)
        return true;
    while(d!=n-1&&x!=n-1){
        x=mulmod(x,x,n);
        d*=2;
    }
    if(x!=n-1)
        return false;
return true;
}
bool isprime(ll n){
if(n==2||n==3)
    return true;
if(n<=1||(n&1)==0)
    return false;
ll d=n-1;
while(d%2==0)
    d>>=1;
for(int i=0; i<4; ++i){
    if(!millerrabin(d,n))
        return false;
}
return true;
}

ll mv(ll x){
ll y=0;
while(x){
    if(x==1){
        ++y;
        break;
    }
    if(isprime(x)){
        y+=x+1;
        return y;
    }
    if(x%2==0){
        y+=x;
        x>>=1LL;
    }
    else{
        for(ll i=3;i*i<=x; i+=2)
            if(x%i==0){
                y+=x;
                x/=i;
                break;}}}
return y;
}

int main(){
    //sp;
pre();
ll moves=0;
ll n,x;
cin>>n;
while(n--){
    cin>>x;
    if(x<mxn)
    moves+=a[x];
    else if(isprime(x))
        moves+=x+1;
    else if((x&(x-1))==0)
        moves+=x+x-1;
    else
      moves+=mv(x);
}
cout<<moves;
return 0;}