def rev(X, mod):
    return pow(X, mod-2, mod)


N = int(input())
A = list(map(int, input().split()))
if 0 in A:
    print(0)
    exit()
mod = 10**9+7
v=1
right=0
sums=1
que=[]
for i in range(N):
    while right < N and v*A[right] < 10**9:
        v *= A[right]
        right += 1
    que.append((i,right))
    v=v//A[i]
how=[]

imos=[0 for i in range(N+1)]
minus_imos=[0 for i in range(N+2)]
for x,y in que:
    imos[x]+=y-x
    minus_imos[x+1]-=1
    minus_imos[y+1]+=1
    # x+1,,,,,y まで-1を配布したい
for i in range(1,N+1):
    imos[i]+=imos[i-1]

for i in range(1,N+1):
    minus_imos[i]+=minus_imos[i-1]
for i in range(1,N+1):
    minus_imos[i]+=minus_imos[i-1]

for i in range(N):
    imos[i]+=minus_imos[i]

ans=1
for i in range(N):
    ans*=pow(A[i],imos[i],mod)
    ans%=mod
print(ans)