#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a,int s[]) {
    
    long int count=0;
    

    for(int i=0;i<a.size();i++)
    {
        if(a[i]==1)
    {
        count+=1;
            continue;
    }
            long int mem=a[i];
          int chain =1;
            for(int j=a[i];j>1;j--)
            {

                if(s[j]==2&&a[i]%j==0)
                {

                    while(a[i]%j==0)
                    {
                        chain*=j;
                        a[i]/=j;
                        count+=chain;

                    }
                }

            }
      if(chain!=1)
      {
        count=count-chain;
        count=count+mem+1;
      }
        else
            count+=mem+1;
        
        
    }
    return count;
   
    
    
}

int main() {
    int n;
    cin >> n;
    int arr[1000001]={0};
    for(int i=1;i<=1000000;i++)
    {
        for(int j=1;i*j<=1000000;j++)
        arr[i*j]++;
    }
  

    
 
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a,arr);
    cout << result << endl;
    return 0;
}