#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
vector<long long> prime;
#define N 1000100
void Eratos() {
    vector<bool> NT(N, true);
    for (int i = 2; i<N; i++) {
        if (NT[i]) {
            prime.push_back(i);
            if (1ll * i * i >= N) continue;
            for (int j = i * i; j < N; j += i) NT[j] = false;
        }
    }
}

long long cal(long long x) {
    long long ans = 1;
    vector<long long> now;
    for (int i = 0; i<(int)prime.size() && x > 1 && prime[i] <= sqrt(x); i++) {
        if (x % prime[i] == 0) {
            while (x % prime[i] == 0) {
                now.push_back(prime[i]);
                x /= prime[i];
            }
        }
    } 
    if (x != 1) now.push_back(x);
    for (long long y : now) ans = ans * y + 1;
    return ans;
}
int main() {  
    int n;
    cin >> n;
    Eratos();
    vector <long long> a(n);
    long long ans = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        ans += cal(a[i]);
    }
    cout<<ans;
    return 0;
}