#include <bits/stdc++.h>
using namespace std;
long moves(long n)
{
    vector<long> prime;
    while (n % 2 == 0)
    {
        prime.push_back(2);
        n = n/2;
    }
    for (long i = 3; i <= sqrt(n); i = i+2)
    {
        while (n % i == 0)
        {
            prime.push_back(i);
            n = n/i;
        }
    }
    if (n > 2)
        prime.push_back(n);
    long mov = 1;
    for(long i = 0; i < prime.size(); i++)
        mov = mov * prime[i] + 1;
    return mov;
}
 
long longestSequence(vector <long> a) {
    long move = 0;
    for(long i = 0; i < a.size(); i++)
        move += moves(a[i]);
    return move;
}

int main() {
    long n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}