#include <bits/stdc++.h>
using namespace std;

using ll = long long;

ll n, size_;
vector<ll> a;
vector<ll> prime;

int used[1000001];

void e() {
  used[0] = used[1] = 1;

  for (int i = 2; i < 1000001; ++i) {
    if (!used[i]) {
      prime.push_back(i);
      size_++;
      for (int j = 2; i * j < 1000001; ++j) {
        used[i * j] = 1;
      }
    }
  }
}

int main() {
  cin.tie(0), cout.tie(0);
  ios::sync_with_stdio(false);

  cin >> n;
  a.resize(n);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }

  e();

  ll ans = 0;

  for (int i = 0; i < n; ++i) {
    long long num = a[i], tmp;
    ll cnt = 0;

    tmp = a[i] + (a[i] == 1 ? 0 : 1);

    while (num > 1 && cnt < size_) {
      if (num % prime[cnt] == 0) {
        num /= prime[cnt];
        if (num > 1) tmp += num;
      }
      else cnt++;
    }

    ans += tmp;
  }

  /*
  for (int i = 0; i < 10; ++i) {
    int p = prime[i];
    cerr << p << " ";
  }
  cerr << endl;
  */

  cout << ans << "\n";

  return 0;
}