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

bool isPrime(ll a)
{
    if (a <= 1)  
        return false;
    if (a <= 3)  
        return true;
    if ((a%2 == 0) || (a%3 == 0)) 
        return false;
    for (ll i=5; i*i<=a; i=i+6)
        if ((a%i == 0) || (a%(i+2) == 0))
           return false;
    return true;
}

ll least(ll a) {
    for(ll i=3;i<=sqrt(a)+1;i++) {
        if(a%i == 0) {
            return i;
        }
    }
    return 1;
}

int main() {  
    ll n,x;
    ll t = 0;
    scanf("%lld",&n);
    while(n--) {
        scanf("%lld",&x);
        if(x == 1) {
            t = t + 1;
        }
        else {
            while(x > 0) {
                if(isPrime(x) == true) {
                    t = t + x + 1;
                    break;
                }
                else if(x%2 == 0) {
                    t = t + x;
                    x = x / 2;
                }
                else {
                    t = t + x;
                    ll b = least(x);
                    x = x / b;
                }   
            }   
        }
    }
    printf("%lld\n",t);
    return 0;
}