#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#define pb push_back
using namespace std;

void solve(long long x,vector<long long> & gg)
{
    for(int i=2;i<=1000000;i++)
    {
        while(x%i==0)
        {
            x=x/i;
            gg.pb(i);
        }
    }
    if(x>1)
        gg.pb(x);
}
int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  long long ans=0;
for(int i=0;i<n;i++)
{
  vector<long long> gg;
    solve(a[i],gg);
    sort(gg.begin(),gg.end(),greater<long long>());
    int len=gg.size();
    gg.pb(1);
    for(int k=len-1;k>=0;k--)
    {   gg[k]=gg[k]*gg[k+1]+1;
    }
    ans+=gg[0];
    //cout<<gg[0]<<endl;
    //cout<<endl;
}   cout<<ans<<endl;
    return 0;
}