SIZE=10**6+10; MOD=10**9+7 #998244353 #ここを変更する

inv = [0]*SIZE  # inv[j] = j^{-1} mod MOD
fac = [0]*SIZE  # fac[j] = j! mod MOD
finv = [0]*SIZE # finv[j] = (j!)^{-1} mod MOD
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE):
    fac[i] = fac[i-1]*i%MOD
finv[-1] = pow(fac[-1],MOD-2,MOD)
for i in range(SIZE-1,0,-1):
    finv[i-1] = finv[i]*i%MOD
    inv[i] = finv[i]*fac[i-1]%MOD

def divisor_list(N): #約数のリスト
    if N == 1: return [1]
    res = []
    for i in range(1,N):
        if i*i >= N: break
        if N%i == 0:
            res.append(i)
            res.append(N//i)
    if i*i == N: res.append(i)
    return sorted(res)

_ = int(input())
*a, = map(int,input().split())
n = sum(a)
div = divisor_list(n)

d = {x:0 for x in div}
for p in div:
    r = fac[n//p]
    for ai in a:
        if ai%p: break
        r = r*finv[ai//p]%MOD
    else:
        d[n//p] = r

L = len(div)
for i in range(L):
    for j in range(i):
        if div[i]%div[j]==0:
            d[div[i]] -= d[div[j]]

ans = 0
for k,v in d.items():
    ans += v*inv[k]%MOD
print(ans%MOD)