#include <iostream>
#include <cmath>
#include <algorithm>

#define ll long long
using namespace std;

ll primeFactors(int n)
{
    if(n==1) return 1;
    ll a[100001];
    ll presum[1000001];
    int k=0;
    while (n%2 == 0)
    {
        a[k++]=2;
        n = n/2;
    }
    for (int i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
            a[k++]=i;
            n = n/i;
        }
    }
    if (n > 2)
     a[k++]=n;
    sort(a,a+k);
    ll sum=0;
    presum[k-1]=a[k-1];
    sum+=presum[k-1];
    for(int i=k-2;i>=0;i--){
        presum[i]=presum[i+1]*a[i];
        sum+=presum[i];
    }
    return sum+1;
}

int main() {

    int n;
    cin>>n;
    ll arr[n+1];
    for(int i=0;i<n;i++) cin>>arr[i];
    ll temp=1,ans=0,div=0;

    while(n--){
      ans+=primeFactors(arr[n]);
    }
    cout<<ans<<"\n";


    return 0;
}