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

int isPrime(int data)
{
    if(data == 2)
        return 1;
    for(int i = 2; i <= data/2; i++)
    {
        if(data % i == 0)
            return 0;
    }
    return 1;
}
int func(int data)
{
    int count = 0;
    int multiplier = 1;
    if(data == 1)
    {
        count++;
        return count;
    }
    if(isPrime(data) == 1)
    {
        count += data + 1;
        return count;
    }
    int divisor = 1;
    while(data != 1)
    {
        if(isPrime(data/divisor) && data % divisor == 0)
        {
            count += (data / divisor)*multiplier;
            multiplier = (data/divisor)*multiplier;
            data = divisor;
            divisor = 1;
        }
        else
            divisor++;
    }
    count++;
    return count;
}

int main() {  
    int n;
    cin >> n;
    int res = 0;
    int cnt;
    long long a[n];
    for (int i = 0; i < n; i++) 
    {
        cin >> a[i];
        cnt = func(a[i]);
        res += cnt;
    }
     
    cout << res;
 
    return 0;
}