#include <bits/stdc++.h>
#include<algorithm>
using namespace std;
bool isPrime(long num){
    bool flag=true;
    for(long i = 2; i <= sqrt(num); i++) {
       if(num % i == 0) {
          flag = false;
          break;
       }
    }
    return flag;
}
long divisor(long num)
{
    long i;
    for(i=2;i<num;i++)
        if(num%i==0)
            break;
    return i;
        
}
long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    vector<long>::iterator it;
    long s=0;
    for(it=a.begin();it!=a.end();it++)
    {
        bool ans = isPrime(*it);
        long temp = *it;
        if(temp==1)
            s+=1;
         else if(ans)
            s+=(*it)+1;
        else if(!ans)
        {
            //cout<<"hey"<<endl;
            long j = divisor(*it);
            //cout<<j<<endl;
            long q = *(it)/j;
           // cout<<q<<endl;
            while(q!=1)
            {
                if(isPrime(q))
                {
                    s+=1;
                    break;
                }
                s=s+q;
               // cout<<s<<endl;
                j = divisor(q);
                q = (q)/j;
                
            }
            s = *(it)+q+s;
        }
    }
    
    return s;
}

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