#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

#define VLL vector<long long>


VLL LPF(){
    long long n=pow(10,6)+5;
    VLL lp(n+1,0);
    lp[1]=1;
    
    for(long long i=2;i<=n;i++){
        if(lp[i]==0){
            lp[i]=i;
            for(long long j=2*i;j<=n;j+=i){
                
                if(lp[j]==0)lp[j]=i;
            }
        }
    }
    return lp;
}


int main() {  
    int n;
    cin >> n;
  
    vector <long long> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
     
    vector<long long> lp = LPF();
    int ans=0;
    
    for (int i = 0; i < n; i++) {
        int a1=a[i];
        int ans1=1;
        while(a1!=1){
            ans1=ans1*lp[a1]+1;
            a1=a1/lp[a1];
        }
        ans+=ans1;
    }
    
    cout<<ans<<endl;
    
    
    /* Enter your code here. Print output to STDOUT */   
 
    return 0;
}