#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
vector<long long > pr;
    int prime[10000011]={0};

void sieve(long long n)
{


    for (long long  p=2; p<=n; p++)
    {
        if (prime[p] == 0)
        {
            for (long long i=p*2; i<=n; i += p)
                prime[i] = 1;
        }
    }

    // Print all prime numbers
    for (long long p=2; p<=n; p++){
       if (prime[p]== 0){
          pr.push_back(p);
           //cout<<p<<" ";
          }
    }
}


int main() {
    
    sieve(1000009);
    
    long long n,x,sum=0,y;
    cin >> n;
  
    for (long long i = 0; i < n; i++) {
        cin >> y;
        sum+=y;
        if(y==1)continue;
        for(long long j=0;j<pr.size();j++){
            //cout<<pr[j]<<" ";
            
            while(y%pr[j]==0){
                x=1;
                y=y/pr[j];
                sum+=y;
            }
            
            if(y==1){break;}
            
        }
        if(y!=1){sum++;}
        
    }
    
    cout<<sum;
    
  
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}