#include<bits/stdc++.h>
using namespace std;
#define ll long long
vector<ll> factorize(ll n){
vector<ll> res;
for(int i=2;i*i<=n;i++){
if(n%i==0){
    while(n%i==0){
        res.push_back(i);
        n/=i;
    }}}
    if(n>1)
        res.push_back(n);

return res;
}
bool isp(ll n){
int c=0;
for(ll i=2;i*i<=n;i++){
    if(n%i==0){
        c++;
        break;
    }
}
if(c==0)
    return 1;
else
    return 0;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin>>n;
    ll a[n];
    ll s=0;
    for(int i=0;i<n;i++)
        cin>>a[i];
    for(int i=0;i<n;i++){
            if(a[i]==1)
            s+=1;
            else{
                if(isp(a[i]))
                    s+=a[i]+1;
                else{
                  s+=1;
                    vector<ll> q=factorize(a[i]);
    sort(q.begin(),q.end(),greater<ll>() );
    ll k=*q.begin(); ll g=k;
    a[i]/=k;
while(isp(a[i])==0){
        s+=g;
    vector<ll> p=factorize(a[i]);
    sort(p.begin(),p.end(),greater<ll>() );
     k=*p.begin();
     a[i]/=k;
     g=g*k;
}
s+=g;
 s+=a[i]*g;
 }
    }}
    cout<<s<<'\n';
    return 0;
}