#include <bits/stdc++.h>

using namespace std;
typedef long long unsigned llu;
typedef long long ll;
llu solve ( llu x)
{
    cout<<x<<endl;
    ll s=sqrt(x);
    for ( ll i=2;i<=s;i++)
    {
        cout<<i<<endl;
        if(s%i==0)
        {
            ll j = s/i;
            ll result = solve(i)*j+1;
            cout<<result<<endl;
            return (result);
        }
    }
    return x+1;
    
}
llu longestSequence(vector <llu> a) {
    //  Return the length of the longest possible sequence of moves.
    llu size=a.size(),ans=0;
    for ( llu i=0;i<size;i++)
    {
        ans+=solve(a[i]);
    }
    return ans;
}

int main() {
    llu n;
    cin >> n;
    vector<llu> a(n);
    for(llu a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    llu result = longestSequence(a);
    cout << result << endl;
    return 0;
}