#include <bits/stdc++.h>

#define ll long long
ll testing( ll t);

using namespace std;

int main()
{
    ll n;
    ll ans =0;
    cin>>n;
    for(ll i=0;i<n;i++)
    {
        ll t;
        ll q = 0;
        ll k;
        cin>>t;
        k = t;
        if(t == 1)
            ans += 1;
        else
        {
            while(q != 1)
            {
                q = testing(k);
                if(q != 1)
                ans += k/q;
                k = k/q;
            }

            ans += t+1;
        }
    }
    cout<<ans<<"\n";
    return 0;
}

ll testing( ll t)
{
    ll number = 1,result =1;
    bool prime = false;
    while(!prime && number <= sqrt(t))
    {
        number++;
        result = t%number;
        if(result == 0)
            prime = true;
    }
    if(prime && t != 2)
        return number;
    else
        return 1;
}