import sys
input = lambda : sys.stdin.readline().rstrip()

sys.setrecursionlimit(2*10**5+10)
write = lambda x: sys.stdout.write(x+"\n")
debug = lambda x: sys.stderr.write(x+"\n")
writef = lambda x: print("{:.12f}".format(x))

### 約数列挙
def fs(n):
    s = set()
    for i in range(1,int(n**0.5)+2):
        if n%i==0:
            s.add(i)
            s.add(n//i)
    l = sorted(list(s))
    return l

k = int(input())
c = list(map(int, input().split()))
M = 10**9+7
ans = 0
size = 0
n = sum(c)
from math import gcd
g = c[0]
for i in range(1,k):
    g = gcd(g, c[i])
g1 = [1]
for i in range(1, n+1):
    g1.append(g1[-1]*i%M)
f = fs(g)
_inv = {}
def inv(v):
    if v in _inv:
        return _inv[v]
    val = pow(v, M-2, M)
    _inv[v] = val
    return val
for v in range(1,n+1):
    tmp = gcd(v,n)
    v = tmp
    d = n//v
    if g%d!=0:
        continue
    val = g1[v]
    for cc in c:
        val *= inv(g1[cc//d])
        val %= M
    ans += val
    ans %= M
#     print(v, d, val)
ans *= pow(n, M-2, M)
print(ans%M)