/* dsingh_24 */
#include<bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define endl        '\n'
#define pll        pair<ll ,ll>
#define vll          vector<ll>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (ll int)x.size()
#define hell        1000000007
#define rep(i,a,b)  for(ll int i=a;i<b;i++)
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define ios         ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
#define N  100005
ll primeFactors(ll n)
{
    vll v;
    ll sum=0,op=1,i;
    while (n%2 == 0)
    {
        v.pb(2);
        n = n/2;
    }
    for (i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
            v.pb(i);
            n = n/i;
        }
    }
    if (n > 2)
        v.pb(n);
    sort(all(v));
    reverse(all(v));
    for(i=0;i<v.size();i++)
    {
        sum+=op;
        op*=v[i];
    }
    return sum;
}
int main()
{
    ios
    ll n,ans=0,x,i,s=0;
    cin>>n;
    for(i=0;i<n;i++)
    {
        cin>>x;
        ans+=primeFactors(x);s+=x;
    }
    cout<<ans+s;
    return 0;
}