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

int prime(long long n)
{
    if(n%2==0) return 0;
    
    for(int i=3;i<=sqrt(n);i+=2)
    {
        if(n%i==0) return 0;
    }
    return 1;
}
long long calculate(long long n)
{
    long long count=0,i,numberofp=1 ;
    
    if(n==1) return 0;
    
    
    
    for(i=n;i>1;i--)
    {
        
        while(n%i==0)
        {
            if(prime(i)==0)break; 
            count+=numberofp;
            n/=i;
            //cout<<i<<"-"<<numberofp<<endl;
            numberofp*=i;
        }
    }
    
    /*if(count==0) return 1;
    
    for(;i<=n;i+=2)
    {
        while(n%i==0)
        {
            count++;
            n/=i;
            cout<<i;
        }
    }*/
    while(n%2==0)
    {
        count+=numberofp;
        n/=2;
        //cout<<2<<"-"<<numberofp<<endl;
        numberofp*=2;//cout<<2;
    }
    return count;
}

int main() {  
    long long n,sum=0;
    cin >> n;
   // cout<<prime(8)<<"A\n";
    long long a[n];
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum+=calculate(a[i])+a[i];
        //cout<<sum<<endl;
    }
     
    cout<<sum;
    return 0;
}