#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
  bool prime [1000001];
  vector <long> p;
  for(int i=0;i<1000001;i++)
      prime[i]=true;
  int i=0;
  prime[0]=false;//  Return the length of the longest possible sequence of moves.
  prime[1]=false;
  prime[2]=true;
    for(i=2;i<=1000000;i++)
    {   
        if(prime[i]==true)
        {
            p.push_back(i);
            long k=i;
            while(k<1000001)
            {
                prime[k]=false;
                k=k+i;
            }
        }
    }
    long sum=0;int pos =0;
    for(i=0;i<a.size();i++)
    {
    long b = a[i];
       sum+=b;
        int j=0;
        for( j=0;j<p.size();j++)
        {
            if(b%p[j]==0)
            {
               while(b%p[j]==0)
               {
                   b=b/p[j];
                   sum+=b;
               }
            }
        }
        
        if(b!=1)
            sum+=1;
        
    }
   
    return sum;
}

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