#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    static long int count=0;
    for(long int i=0;i<a.size();i++)
    {
        long int x=a[i];
        if(x==1)
                count++;
    
        else
        {
            while(x>1)
            {
             long int j;
                
                long int sq = sqrt(x);
         
                for(j = 2; j <= sq; j++) 
                {
                    if(x%j == 0)
                    {
                            count+=x;
                            x=x/j;
                           
                            break;
                    }
                }
                
                if(j>sq)
                {
                    count+=x+1;
                    goto end;
                }
             
            }
           
        }
        
        end:;
    }
    return count;
}


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);
    cout << result << endl;
    return 0;
}