#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long len=0;
    for(int i=0;i<a.size();i++)
    {
        long sum=a[i];
        while(a[i]%2==0)
        {
            a[i]=a[i]/2;
            sum+=a[i];
        }
        if(a[i]!=1)
        {
            while(1)
            {long j;
                
                for(j=2;j<=sqrt(a[i]);j++)
                {
                    if(a[i]%j==0)
                    {
                        a[i]/=j;
                        sum+=a[i];
                        break;
                    }
                }
                if(j>sqrt(a[i]))
                    break;
            }
        }
        if(a[i]!=1)
            sum+=1;
       len+=sum;
    }
    return len;
    
}

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;
}