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

long long int smallestFactor(long long int C)
{
    for (long long int i = 2; i*i<= C; i++) 
    {   
        if (C % i == 0)
        {
            return i;
        }
    }

    return C;
}
long long int find(long long int x)
{
    long long int temp = x, sum = 0;
    while(temp%2 == 0)
    {
        sum+=temp;
        temp = temp>>1;
        
    }
    long long int smallest_fact;
    while(temp!=1)
    {
        smallest_fact = smallestFactor(temp);
        while(temp%smallest_fact == 0)
        {
            sum+=temp;
            temp = temp/smallest_fact;
        }
    }
    
    return sum+1;
}

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