#include <bits/stdc++.h>

typedef long long int lld;

lld A[1100000];
lld primes[1000000];
lld pC;
lld kapa = 1100000;
lld K[10000];
lld m;

void Sieve();

int main()
{
    memset(A, 1, sizeof(A));
    A[0] = A[1] = 0;
    int i = 2;
    while(i*i <= 1100000)
    {
        if(A[i])
        {
            int j = 2*i;
            while(j < kapa){
                A[j] = 0;
                j+=i;
            }
        }
        i++;
    }
    pC = 0;
    for(int i = 0; i < kapa; i++)
        if(A[i])
            primes[pC++] = i;
    lld n;
    lld ans = 0;
    scanf("%lld", &n);
    i = 0;
    while(i < n){
        scanf("%lld", &A[i]);
        i++;
    }
    i = 0;
    while(i < n)
    {
        lld napa = A[i];
        m = 0;
        for(int j=0; j <pC; j++)
        {
            while(napa % primes[j] == 0)
            {
                K[m++] = primes[j];
                napa /= primes[j];
            }
        }
        if(napa != 1)
            K[m++] = napa;
        napa = 1;
        lld zeta = 1;
        int j = m-1;
        while(j>=0)
        {
            zeta *= K[j];
            napa += zeta;
            j--;
        }
        ans += napa;
        i++;
    }
    printf("%lld\n", ans);
    return 0;
}