// In the name of Allah the Lord of the Worlds.

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

const int MAX = 1e6+9;

bool isPrime[MAX+9];

vector<ll>primes;

map<ll,ll>dp;

void seive()
{
    for(int i=0;i<=MAX;i++)isPrime[i] = true;

    for(int i=2;i<=MAX;i++){

        if(isPrime[i]==true){

            for(int j=2*i;j<=MAX;j+=i){

                isPrime[j] = false;
            }

            primes.push_back(i);
        }
    }
}

ll f(ll n)
{
    //if(n==1)return 1;

    if(dp[n]!=0)return dp[n];

    vector<ll>v;

    ll n_temp = n;

    if(n>1)v.push_back(n);
    int sz = primes.size();

    for(int i=0;i<sz&&primes[i]*primes[i]<=n_temp;i++){

        if(n_temp%primes[i]==0){

            v.push_back(primes[i]);
            ll temp = n_temp/primes[i];
            if(n_temp%temp==0)v.push_back(temp);

            while(n_temp%primes[i]==0){

                n_temp/=primes[i];
            }
        }
    }

    if(n_temp>1)v.push_back(n_temp);

    int si = v.size();

    ll value = 0;


    for(int i=0;i<si;i++){

        //if(n/v[i]==1) value = max(value ,f(n/v[i])*v[i]);
        value = max(value ,f(n/v[i])*v[i]+v[i]);
    }

    return dp[n] = value;
}

int main(void)
{
    seive();

    int n;
    scanf("%d",&n);

    ll value = 0;

    for(int i=0;i<n;i++){

        dp.clear();

        ll in;
        scanf("%lld",&in);
        value+=f(in)+1;

    }

    printf("%lld\n",value);

    return 0;
}