#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define sc(n) scanf("%d",&n)
#define scl(n) scanf("%lld",&n)
#define pr(n) printf("%d",n)
#define prl(n) printf("%lld",n)
#define nl printf("\n")
#define fr(i,n) for(i=0;i<n;i++)

typedef long long ll;
vector<int> primes;
int sieve[1000010];
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int t=1,n,i,j;
    ll x;
    int lim = 1e6+1;
    for(int i=2;i<=lim;i++)
    {
       if(!sieve[i]){
           for(int j=i+i;j<=lim;j+=i)
           sieve[j]=1;
           primes.pb(i);
       }

    }
    cin>>n;
    ll ans =0;
    fr(i,n)
    {
        cin>>x;
        if (x<=2)ans+=(2*x-1);
        else
        {
        ll cur = 1;
        ans += x;
        for(int j=0;j<primes.size();j++)
            if (x%primes[j]==0)
            {
                ll tmp = x;
                while(tmp%primes[j]==0)
                {   cur= cur*primes[j]; 
                    ans+=(x/cur);
                    tmp/=primes[j];
                }
               
            }
        if (cur!=x)ans++;
        }
    }
    cout<<ans<<"\n";


    
    return 0;
}