def inv(p,m):
    # return 1/p mod m , that is, return (a,b) s.t pa+bm = 1 (and get a)
    if p>m:
        b,a=inv(m,p)
        return (a,b)
    if p==1:
        return (1,0)
    # m=cp+r
    # pa+b(cp+r)=1 <=> (a+bc)p + br = 1
    c=m/p
    r=m%p
    b,a_bc=inv(r,p)
    return (a_bc-b*c, b)

def gcd(a,b):
    if b<a:
        return gcd(b,a)
    if b%a == 0:
        return a
    return gcd(b%a,a)

mod=1000000007
K=int(raw_input())
C=map(int,raw_input().split())
F=[1 for i in xrange(1000001)]
for i in xrange(1,1000001):
    F[i]=F[i-1]*i
    F[i]%=mod
g=C[0]
L=0
for c in C:
    g=gcd(g,c)
    L+=c

D=[i for i in range(1,g+1) if g%i==0]
Cnt=[0 for d in D]
ans=0
for i in xrange(len(D)-1,-1,-1):
    d=D[i]
    tCnt=F[L/d]
    #print F[L/d],
    for c in C:
        #print "/",F[c/d],
        tCnt*=inv(F[c/d],mod)[0]
        tCnt%=mod
    #print "=",tCnt
    Cnt[i]+=tCnt
    for j in xrange(i-1,-1,-1):
        if d%D[j]==0:
            Cnt[j]-=Cnt[i]
            Cnt[j]%=mod
    ans+=(Cnt[i]*inv(L/d,mod)[0])
    ans%=mod
#for c,d in zip(Cnt,D):
#    print L/d,":",c
print ans