#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
bool isprime(long long int num)
{
    for(int i=2;i<=(long long int)sqrt(num);i++)
        if(num%i==0)
            return false;
    return true;
}
long long int divide(long long int num)
{
    long long int result = num;
    
        while(num%2==0)
        {
            num=(long long int)(num/2);
            result+=num;
        }
        if(isprime(num))
            return result+1;
        for(int i=3;i<=(long long int)sqrt(num);i+=2)
        {
            if(num%i==0)
            {
                
                num=(long long int)(num/i);
                result+=num;
            }
            if(isprime(num))
                return result+1;
        }
        
    if(isprime(num))
        return result+num+1;
    else
        return result;
}
int main() {  
    int n;
    cin >> n;
  
    vector <long long int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    long long int result = 0;
    for(int i = 0; i < n; i++) {
        if(a[i]==1)
            result +=1;
        else if(isprime(a[i]))
            result += a[i]+1;
        else
        {
           result += divide(a[i]);
        }
    }   
    cout<<result<<endl;
    return 0;
}