#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
vector<long long >v;
bool h[1000008]={false};
long long queen(long long x,long long ans,long long temp)
{
    long long i,j;
    for(i=v.size()-1;i>=0;i--)
    {
        while(temp%v[i]==0)
        {
            ans+=x/temp;
            temp/=v[i];
           // cout<<temp<<" "<<ans<<"\n";
        }
    }
    if(temp!=1 && ans!=0)
        return queen(x,1,x/temp);
    else if(temp!=1 && ans==0)
        return 1;
   // cout<<ans<<"\n";
        return ans;
}
int main() {  
    int i,j;
    for(i=2;i<=1000;i++)
    {
        if(!h[i])
        {
            j=i*i;
            while(j<=1000000)
            {
                h[j]=true;
                j+=i;
            }
        }
    }
    for(i=2;i<=1000000;i++)
        if(!h[i])
            v.push_back(i);
    int n;
    cin >> n;
  
    long long x,ans=0;
    for (i = 0; i < n; i++) {
        cin>>x;
        ans+=queen(x,0,x)+x;
    }
    cout<<ans<<"\n";
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}