#include <bits/stdc++.h>

using namespace std;

long longestSequence(long a[],int n) {
int i;
    long result=0;
    for(i=0;i<n;i++)
    {
        long num=a[i];
        long sum=0;
        
        if(num%2==0)
        {
            while(num>0)
            {
                sum+=num;
                num=num/2;  
            }
        }
        else if(num%2!=0)
        {
            if(num>1)
            {
            sum+=num;
            long temp;
           
            
            while(num>0)
            {
                
            for(long j=2;j<=num;j++)
            {
                if(num%j==0)
                {
                    
                    temp=j;
                    break;
                }
            }
            num=num/temp;
                
            sum+=num;
            }
            }
            else if(num==1)
            {
                sum=1;
            }
        }
       
        result+=sum;
        
       
        }
    return result;
}

int main() {
    int n;
    cin >> n;
    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;
}