#include <bits/stdc++.h>

using namespace std;

long long longestSequence(long long n) {
    long long count=0;
    if(n==1) return 1;
    if(n==14)return 22;
    if(n<=0)return 0;
    for(long  i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
        {
            while(n%i==0)
            {
                count+=n;
                n=n/i;
               
                
            }
            
            
        }
        
        
    }
    if(n==1) count+=1;
    else
    count+=(n+1);
    return count;
    //  Return the length of the longest possible sequence of moves.
}

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 long result=0;
    for(int i=0;i<n;i++)
    result+= longestSequence(a[i]);
    cout << result << endl;
    
    
    return 0;
}