#include <bits/stdc++.h>

using namespace std;

long long find(long long a,vector<long long> two_pow)
{
    int l = two_pow.size();
    long long pieces = 1,piece_size = a,moves = piece_size;
    
   for(int i = 2;i<=sqrt(a);i++)
   {
        if(piece_size%i == 0)
        {
            
            piece_size = piece_size/i;
            //cout<<piece_size<<endl;
            moves = moves+piece_size;
            i--;
        }
        if(piece_size == 1) {break;}

   }
   if(piece_size!=1) moves++;
   return moves;
    
} 

int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    vector <long long> two_pow;
    
    long long b = 1;
    while(b <= 1000000000000)
    {
        two_pow.push_back(b);
        b = b * 2;
    }
    
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    for(int i = 0;i<n;i++)
    {
        sum+=find(a[i],two_pow);
    }
    
    cout<<sum<<endl;
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}