#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
long long finder(long long a)
{
    long long ans=0;
    long long b=2;
    while(a>=1)
    {
        if (a==1)
        {
            ans++;
            break;
        }
        else
        {
        if(a%b==0)
        {
            ans=ans+a;
            a=a/b;
            continue;
        }
        else{
            b++;
            continue;
        }
        }
    }
    return(ans);
}
long longestSequence(vector <long long> a, int n) {
    //  Return the length of the longest possible sequence of moves.
    long long count=0;
    for(long long i=0;i<n;i++)
    {
        long long s=a[i];
        count=count+finder(s);
    }
    return(count);
}
int main() {
    int n;
    cin >> n;

    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }

    /* Enter your code here. Print output to STDOUT */
    long long result = longestSequence(a,n);
    cout << result << endl;
    return 0;
}