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

long long largestDivisor(long long i){
    long long r = 0;
    if(i % 2 != 0){
        for(long long j = 3; j <= ceil(sqrt(i)); j+=2){
            if(i % j == 0){
                r = i / j;
                break;
            }
        }
        if(r == 0){
            r = 1;
        } 
    }else{
        r = i / 2;
    }
    return r;
}


long long ans(long long n){
    long long r = n;
    long long tmp = n;
    while(tmp != 1){
        tmp = largestDivisor(tmp);
        r += tmp;
    }
    return r;
}

int main() {  
    int n;
    cin >> n;
    
    long long sum = 0;
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        sum += ans(a[i]);
    }    
    cout << sum << endl;
    return 0;
}