#include <bits/stdc++.h>
#define mod 1000000007
#define pb push_back
#define mid(l, r) ((l)+(r))/2
#define len(a) (a).length()
#define sz(a) (a).size()
#define xx first
#define yy second
#define inf int(2e9)
#define ff(i, a, b) for(int (i) = (a); (i) <= (b); ++(i))
#define fb(i, a, b) for(int (i) = (a); (i) >= (b); --(i))


using namespace std;

typedef unsigned long long ll;
typedef pair<int,int> pii;

template<class T>
void print(const T niz[], const int siz)
{
    for(int i=0;i<siz;i++)
        cout << niz[i] << " ";
    cout << endl;
}

ll resenje;
bool isprime[1000005];
vector<ll>prosti;
void sito()
{
    ff(i,2,1000002)
    {
        if(!isprime[i])
        {
            prosti.pb(i);
            for(int j=i*2;j<=1000002;j+=i)
                isprime[i]=true;
        }
    }
}
ll solve(ll broj)
{
    if(broj==1)
        return 1;
    ll ans=broj;
    for(auto c:prosti)
    {
            while(broj%c==0)
            {
                broj/=c;
                if(broj!=1)
                ans+=broj;
            }
    }
    return ans+1;
}
int main()
{
    sito();
    int n;
    cin>>n;
    ff(i,0,n-1)
    {
        ll broj;
        cin>>broj;
        resenje+=solve(broj);
    }
    cout<<resenje;
    return 0;
}