def syakutori(A):

    total=1

    def merge(total,Ai):
        total*=Ai
        return total

    def inv_merge(total,Ai):
        total//=Ai
        return total

    def is_possible_merge(total,Ai):
        return total*Ai<10**9

    N=len(A)
    left, right, right_max=0,0,N
    res=1
    T=1
    S=1
    for left in range(right_max):
        while right<right_max and is_possible_merge(total,A[right]):
            total = merge(total,A[right])
            S*=A[right]
            S%=MOD
            T*=S
            T%=MOD
            right+=1
        res*=T
        res%=MOD
        if right==left:
            right+=1
        else:
            total = inv_merge(total,A[left])
            S*=pow(A[left],MOD-2,MOD)
            S%=MOD
            T*=pow(A[left],MOD-1-(right-left),MOD)
            T%=MOD


    return res


#########################################
import sys
input = sys.stdin.readline

K=10**9

MOD=10**9+7

N=int(input())
A=list(map(int, input().split()))

if 0 in A:
    print(0)
else:
    res=syakutori(A)
    print(res)