#include<bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
//namespace mp = boost::multiprecision;
using namespace std; 
#define ll long long int
#define dbl double
#define si set<ll>
#define vi vector<int>
#define vs vector<string>
#define vii vector<vi>
#define vll vector<ll>
#define vdbl vector<dbl>
#define mii map<int,int>
#define pii pair<int,int>
#define pff pair<double,double>
#define fr(i,n) for(int i=0;i<n;i++)
int mymin(vll v)
{
    return *min_element(v.begin(),v.end());
}
ll mymax(vll v)
{
    return *max_element(v.begin(),v.end());
}
ll power(ll a, ll b, ll p)
{
    ll res = 1;
    a %= p;
    while(b!=0)
    {
        if(b%2)
            res = (res%p*a%p)%p;
        b /= 2;
        a = (a%p*a%p)%p;
    }
    return res;
}
vector<string> split(string str,char delimeter)
{
    vector<string> res;
    istringstream iss(str);
    string token;
    while(getline(iss,token,delimeter))
    {
        if(token.length()>0)
        res.push_back(token);
    }
    return res;
}
void randomize (vi &arr)
{
    srand (time(NULL));
    for (int i = arr.size()-1; i > 0; i--)
    {
        int j = rand() % (i+1);
        swap(arr[i], arr[j]);
    }
}
#define mxx 1000001
#define mmm INT_MAX
#define mymod 1000000007
#define pcal 1e-19
#define pi 3.1415926535897932384
bool is_prime[mxx];
ll get_least_fact(ll n)
{
    for(int i=2;i<mxx;i++)
        if(is_prime[i] && n%i==0)
            return i;
    return n;
}
ll solve(ll n)
{
    if(n==1)
        return 1;
    return n+solve(n/get_least_fact(n));
}
int main()
{
    clock_t tstart = clock();
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    //cout<<fixed<<setprecision(17);
    //srand ( time(NULL) );
    memset(is_prime,1,sizeof is_prime);
    is_prime[0]=0;
    is_prime[1]=0;
    for(int i=2;i<=sqrt(mxx);i++)
        if(is_prime[i])
        for(int k=2;k*i<mxx;k++)
            is_prime[k*i]=0;
    int t;
    cin>>t;
    ll ans = 0;
    while(t--)
    {
        ll n;
        cin>>n;
        ans += solve(n);
    }
    cout<<ans<<"\n";
    //cout<<"\n\nTotal Time Taken : "<<(double)(-tstart + clock())/CLOCKS_PER_SEC<<"sec\n\n";
    return 0;
}