#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() 
{  
    long long n, a[100], ans = 0, prime[1000005], fin[1000005], count = 0, k, temp, p;
    for(long i = 2; i<=1000000; i++)
        prime[i] = 1;
    for(long i = 2; i<=1000000; i++)
        if(prime[i] == 1)
            for(long j = 2; i*j<=1000000; j++)
                prime[i*j] = 0;
    for(long i = 2; i<=1000000; i++)
        if(prime[i] == 1)
            fin[count++] = i;
    cin>>n;
    for(long i = 0; i<n; i++)
        cin>>a[i];
    ans = n;
    for(long i = 0; i<n; i++)
    {
        k = 1;
        temp = 0;
        p = a[i];
        for(long j = count - 1; j>=0; j--)
            if(a[i]%fin[j] == 0)
            {
                k = k*fin[j];
                temp = temp + k;
                a[i] = a[i]/fin[j];
                j++;
            }
        if(a[i]!=1)
        {
            temp = a[i];
            k = a[i];
            a[i] = p;
            for(long j = count - 1; j>=0; j--)
            if(a[i]%fin[j] == 0)
            {
                k = k*fin[j];
                temp = temp + k;
                a[i] = a[i]/fin[j];
                j++;
            }
        }
        ans = ans + temp;
    }
    cout<<ans<<endl;
    return 0;
}