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

long long sqroot(long long n)
{
    vector<long long> facts;
    facts.push_back(1);
    long long sum=0;
    long long tmp=n;
    while(tmp%2==0)
    {
        facts.push_back(2);
        tmp/=2;
    }
    
    for(long long i=3;i*i<=tmp;i+=2)
    {
        while(tmp%i==0)
        {
            facts.push_back(i);
            tmp/=i;
        }
    }
    
    if(tmp>1)
        facts.push_back(tmp);
    
    tmp=n;
    for(long long i=0;i<facts.size()-1;i++)
    {
        sum+= tmp/facts[i];
        tmp/=facts[i];
    }
    
    return sum+1;
    
    
    
    
}
int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
  
    long long sum=0;
    
    for(int i=0;i<n;i++)
    {
        long long tmp= sqroot(a[i]);
        
        sum+=tmp;
     }
    cout<<sum;
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}