#include <bits/stdc++.h>

using namespace std;
long getCount(long num)
{
    long int steps=0;
    long x=2;
    
   while(num!=1)
   {
        x=2;   
       while(num%x!=0&&x<=num/2)
           x++;
       if(num%x!=0)
       {
           steps+=num;
           break;
       }
       steps+=num;
       num=num/x;
   }
    steps+=1;
    return steps;
}
long longestSequence(vector <long> a,int n) 
{
    int curr;
    int x=2;
   long int steps=0;
    for(int i=0;i<n;i++)
        steps+=getCount(a[i]);
    return steps;
}

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