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

const int MOD = int(1e9) + 7;
const int MAXK = 1 << 17;
const int MAXTOT = 1 << 20;

int inv_mod(int v, int m = MOD) {
  int r = 1;
  for (int p = m - 2; p; p >>= 1) {
    if (p & 1) r = 1LL * r * v % m;
    v = 1LL * v * v % m;
  }
  return r;
}

int fac[MAXTOT];

int K;
int C[MAXK];
int T;
int G;

int dp[MAXTOT];

signed main() {
  ios::sync_with_stdio(false);
  for (int i = fac[0] = 1; i < MAXTOT; ++i) {
    fac[i] = 1LL * fac[i - 1] * i % MOD;
  }
  cin >> K;
  for (int i = 0; i < K; ++i) {
    cin >> C[i];
    T += C[i];
    G = __gcd(G, C[i]);
  }
  vector<int> periods;
  for (int i = 1; i * i <= G; ++i) {
    if (G % i != 0) continue;
    periods.emplace_back(T / i);
    if (i * i == G) break;
    periods.emplace_back(T / (G / i));
  }
  sort(periods.begin(), periods.end());
  int ans = 0;
  for (int i = 0; i < periods.size(); ++i) {
    int p = periods[i];
    dp[p] = fac[p];
    for (int j = 0; j < K; ++j) {
      dp[p] = 1LL * dp[p] * inv_mod(fac[C[j] / (T / p)]) % MOD;
    }
    for (int j = 0; j < i; ++j) {
      int q = periods[j];
      if (p % q != 0) continue;
      (dp[p] -= dp[q]) %= MOD;
    }
    (ans += 1LL * dp[p] * inv_mod(p) % MOD) %= MOD;
  }
  if (ans < 0) ans += MOD;
  cout << ans << endl;
  return 0;
}