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

vector<unsigned long long> primes(unsigned long long);

int main() {
   unsigned long long n, ms=0;
   vector<unsigned long long> sv;
   cin>>n;
   while (n--) {
      unsigned long long s;
      cin>>s;
      sv.push_back(s);
      ms=s>ms?s:ms;
   }
   vector<unsigned long long> p=primes(((unsigned long long)sqrt(ms))+1);

   unsigned long long int c=0;
   for (unsigned long i=0; i<sv.size(); ++i) {
      unsigned long long s=sv[i];
      unsigned long long int cc=1, cp=1;
      while (s!=1) {
         char d=0;
         for (long j=p.size()-1; j>=0; --j) {
            if (s%p[j]==0) {
               s/=p[j];
               cp*=p[j];
               cc+=cp;
               d=1;
               break;
            }
         }
         if (!d) {
            cp*=s;
            cc+=cp;
            s=1;
         }
      }
      c+=cc;
   }
   cout<<c<<endl;
   return 0;
}

vector<unsigned long long> primes(unsigned long long limit) {
   ++limit;
   char p[limit];
   for (unsigned long i=2; i<limit; ++i) p[i]=0;
   vector<unsigned long long> out;
   for (unsigned long i=2; i<((unsigned long)sqrt(limit))+1; ++i) {
      if (p[i]) continue;
      for (unsigned long j=2; i*j<limit; ++j) {
         p[i*j]=1;
      }
   }
   for (unsigned long i=2; i<limit; ++i) {
      if (!p[i]) out.push_back(i);
   }
   return out;
}