#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <queue>

using namespace std;

long long ans(long long int n, queue<long long> &q){
    if (n == 0 || n == 1) return n;
    long long int i = 2;
    while(n%i == 0) {
        n = n/i;
        q.push(i);
    }
    i = 3;
    while(n % i == 0){
        n = n/i;
        q.push(i);
    }
    for(i = 6; i - 1 <= sqrt(n); i += 6){
        while ((n % (i-1)) == 0){
            n = n/(i-1);
            q.push(i-1);
        }
        while ((n % (i+1)) == 0){
            n = n/(i+1);
            q.push(i+1);
        }
    }
    if (n > 1) q.push(n);
    long long int res = 0;
    
    res += 1 + q.front();
    q.pop();
    while(!q.empty()){
        
        res = 1 + q.front() * res;
        q.pop();
    }
    return res;
}

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