#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
import numpy as np
MOD = 10 ** 9 + 7


def cumprod(A, MOD=MOD):
    L = len(A)
    Lsq = int(L**.5 + 1)
    A = np.resize(A, Lsq**2).reshape(Lsq, Lsq)
    for n in range(1, Lsq):
        A[:, n] *= A[:, n - 1]
        A[:, n] %= MOD
    for n in range(1, Lsq):
        A[n] *= A[n - 1, -1]
        A[n] %= MOD
    return A.ravel()[:L]


def make_fact(U, MOD=MOD):
    x = np.arange(U, dtype=np.int64)
    x[0] = 1
    fact = cumprod(x, MOD)
    x = np.arange(U, 0, -1, dtype=np.int64)
    x[0] = pow(int(fact[-1]), MOD - 2, MOD)
    fact_inv = cumprod(x, MOD)[::-1]
    fact.flags.writeable = False
    fact_inv.flags.writeable = False
    return fact, fact_inv


K = int(readline())
C = np.array(read().split(), np.int64)
N = C.sum()
D = np.gcd.reduce(C)
x = np.arange(1, 1100)
div = x[D % x == 0]
div = np.union1d(div, D // div)

fact, fact_inv = make_fact(N + 1)


def f(d):
    num = fact[N // d]
    den = cumprod(fact_inv[C // d])[-1]
    return num * den % MOD


dp = {d: f(d) for d in div}
keys = sorted(div, reverse=True)
for d in keys:
    x = dp[d]
    for e in keys:
        if e <= d or e % d != 0:
            continue
        x -= dp[e]
    dp[d] = x

answer = sum(k * v for k, v in dp.items()) % MOD
answer *= pow(int(N), MOD - 2, MOD)
answer %= MOD
print(answer)