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

int MOD = 1e9+7;

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

long inv(long a) {
  long b = MOD, u = 1, v = 0;
  while (b) {
    long t = a / b;
    a -= t * b; swap(a, b);
    u -= t * v; swap(u, v);
  }
  u %= MOD;
  if (u < 0) u += MOD;
  return u;
}

int main() {
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++) cin >> A.at(i);
  vector<int> cnt(1e6+1);
  for (auto a : A) {
    for (auto [x, y] : pf(a)) cnt.at(x) = max(cnt.at(x), y);
  }
  long lcm = 1;
  for (int i = 0; i < 1e6+1; i++) {
    int tmp = cnt.at(i);
    while (tmp--) {
      lcm *= i;
      lcm %= MOD;
    }
  }
  long ans = 0;
  for (auto a : A) {
    auto i = inv(a);
    ans += lcm * i;
    ans %= MOD;
  }
  cout << ans << "\n";
}