#include <bits/stdc++.h>

using namespace std;

bool prime(long long int i)
{
    if(i==2||i==3) return true;
    if(i%2==0) return false;
    for(long long int j=3;j*j<=i;j++) if(i%j==0) return false;
    return true;
}

long long int fac(long long int i)
{
    if(i==1) return 1;
    if(prime(i)) return i+1;
    //if(perfect(i)) return i+perfect(i)+1;
    for(long long int j=2;j<i;j++) if(i%j==0) return i+fac(i/j);
    return 1;
}



long longestSequence(vector <long long> a,int t) {
    //  Return the length of the longest possible sequence of moves.
        long total=0;
        for(long long int i=0;i<t;i++) total+=fac(a[i]);
        return total;}

int main() {
    int n;
    cin >> n;
    vector<long long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long long result = longestSequence(a,n);
    cout << result << endl;
   // if(prime(9)) cout<<"YAY";
    return 0;
}