#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a,int n) 
{
    int arr[n];
    for(int z=0;z<n;z++)
    {if(a[z]==1)
        {
            arr[z]=1;
            continue;
        }
    int i;
    for(i=2;i<a[z];i++)
    {
        if(a[z]%i==0)
            break;
    }
    if(i==a[z])
       {
          arr[z]=a[z]+1;
          continue;
       }
    int j;
    for(j=10;j>=0;j--)
    {
        int k=pow(i,j);
        if(a[z]%k==0)
            break;
    }
    int t=0;
    for(int b=j;b>=0;b--)
    {
        int p=pow(i,b);
        t=t+(a[z]/p);
    }
    arr[z]=t+1;
    }
    int sum=0;
    for(int i=0;i<n;i++)
        sum=sum+arr[i];
    return sum;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a,n);
    cout << result << endl;
    return 0;
}