#include<bits/stdc++.h>
#define OO 1e9
using namespace std;

#define ll long long

ll solve(ll t){
    if(t==1) return 1;
    vector<ll> pf;

    ll temp=t;
    for(ll i=2; i*i<=t; i++){
        while(temp%i==0){
            temp/=i;
            pf.push_back(i);

        }
    }
    if(temp!=1) pf.push_back(temp);
    reverse(pf.begin(),pf.end());

    pf.pop_back();
    reverse(pf.begin(),pf.end());

    ll ans=1;
    for(int i=0; i<pf.size(); i++){
        ans*=pf[i];
        ans++;
    }
    return ans+t;

}

int main()
{

    int t;
scanf("%d",&t);
    ll ans=0;
while(t--){
   ll n;
   scanf("%lld",&n);

   ans+=solve(n);
   //cout<<n<<" "<<solve(n)<<endl;
}
printf("%lld",ans);

}