#include <iostream>
#include <vector>
#include <map>
#include <math.h>
#include <fstream>
using namespace std;

//Eratosthenes sieve.
//Finds all primes below a limit n
//Space O(n)
//Time O(n logn loglogn)
class esieve{
public:
  vector<bool> isp;
  long count;
public:
  esieve(long num) {isp.resize(num,1); count=0;}
  long build();
};

long esieve::build(){
  isp[0]=0;
  isp[1]=0;

  long c;
  for(long i=2; i<isp.size(); i++){
    if(isp[i]==0) continue;
    count++;
    //cout << i << endl;
    c=2*i;
    while(c<isp.size()){
      isp[c]=0;
      c+=i;
    }
  }
  return count;
}

//Factor sieve. Used to find factorization of a all numbers less than n.
class fsieve{
public:
  vector<long> isp;
public:
  fsieve(long num) {
    isp.resize(num,1);
    build();
  }
  void build();
};

vector<long> primes;

void fsieve::build(){
  //cout << "Building ... " << endl;
  isp[0]=0;
  isp[1]=0;

  long c;
  long imax = isp.size(); //long(sqrt(double(isp.size())) + 2);
  for(long i=2; i<imax; i++){
    if(isp[i]!=1) continue;
    isp[i]=i;
    primes.push_back(i);
    c=i*i;
    while(c<isp.size()){
      if( isp[c]==1) isp[c]=i;
      c+=i;
    }
  }
}

//fsieve fs( long(2e7) + 1);
// bool mf(long num, map<long, long>&p2p){

//   while(num > 1){
//     long addp = fs.isp[num];
//     num/=addp;

//     if( p2p.find(addp) == p2p.end() ) p2p[addp]=1;
//     else p2p[addp]++;
//   }
//   return 1;
// }

vector<long> primes2;


long solve2(long a, vector<long> &v){
  if(a==1) return 1;

  long p = v[v.size()-1];
  v.pop_back();

  return ( long(1) + p*solve2(a/p, v) ); 
}


long solve(long a){

  long n = a;
  
  vector<long> v;
  for(int i=0; i<primes2.size(); i++){
    while( n%primes2[i] ==0 ){
      n /= primes2[i];
      v.push_back(primes2[i]);
      if(n==1) break;
    }
  }

  if(n!=1)
    v.push_back(n);

 //  for(auto j: v)
//     cout << j << " ";
//   cout << endl;

  return solve2(a, v);
}



int main(){
  //std::ifstream in("in");
  //std::streambuf *cinbuf = std::cin.rdbuf(); //save old buf
  //std::cin.rdbuf(in.rdbuf()); //redirect std::cin to in.txt!
  
  esieve s(long(1e6)+2);
  s.build();
  
  for(long i=2; i<s.isp.size(); i++){
    if( s.isp[i]== 0 ) continue;
    primes2.push_back(i);
  }
  s.isp.clear();

  int n;
  cin >> n;
  long ans = 0;
  
  
  while(n--){
    long aka;
    cin >> aka;
    ans += solve(aka);
  }
  
  cout << ans << endl;
  
}