#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
long long int findfactor(long long int stick)
{
    long long int sqt=sqrt(stick);
    for(int i=2;i<=sqt;i++)
    {
        if(stick%i==0)
        {
            return i;
        }
    }
    return -1;
}
int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  
    /* Enter your code here. Print output to STDOUT */   
    long long int finalmoves=0;
    for(int i=0;i<n;i++)
    {
        long long int stick=a[i];
        long long int moves=stick;
        while(stick>1)
        {
          long long int factor=findfactor(stick);
            if(factor==-1)
            {
                moves+=1;
                break;
            }
          long long int temp=stick/factor;
           stick/=factor;
            moves+=temp;
        }
        finalmoves+=moves;
        
        
    }
     cout<<finalmoves<<endl;  
 
    return 0;
}