#include <bits/stdc++.h>

using namespace std;

long find(long x)
{
    long i, flag=1, y=(x+1);
    if(x==1)
        return 1;
    while(x!=1 && flag==1)
    {
    for(i=2;i<=sqrt(x);i++)
    { if((x%i)==0)
        {
         y+=(x/i);
         x/=i;
         break;  
        }
    }
       if(i>sqrt(x))
           flag=0;
    }   
     return y;
}

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

int main() {
    int 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, n);
    cout << result << endl;
    return 0;
}