#include <bits/stdc++.h>

using namespace std;

using int64 = long long;


map< int64, int > prime_factor(int64 n)
{
  map< int64, int > ret;
  for(int64 i = 2; i * i <= n; i++) {
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return (ret);
}

int main()
{
  int N;
  cin >> N;
  int64 all = 0;
  while(N--) {
    int64 X;
    cin >> X;
    auto p = prime_factor(X);
    int64 cur = X;
    vector< pair< int64, int64 > > vs(p.begin(), p.end());
    sort(vs.rbegin(), vs.rend());
    for(auto s : vs) {
      while(s.second > 0) {
        all += X / cur;
        cur /= s.first;
        --s.second;
      }
    }
    all += X;
  }
  cout << all << endl;

}