import std.numeric, std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons;
T[][] combinations(T)(T[] s, in int m) {   if (!m) return [[]];   if (s.empty) return [];   return s[1 .. $].combinations(m - 1).map!(x => s[0] ~ x).array ~ s[1 .. $].combinations(m); }

T lcm(T)(in T a, in T b) {
  return a / gcd(a,b) * b;
}

void main() {
  auto N = readln.chomp.to!(int);
  auto A = readln.split.to!(ulong[]);

  void solve() {
    ulong gcd = A[0];
    foreach(Ai; A[1..N]) gcd = gcd.lcm(Ai);

    ulong answer;
    foreach(Ai; A) {
      answer = gcd / Ai;
      answer %= 1000000007;
    }

    answer.writeln;
  }

  solve();
}
