from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

class imos_line():
    
    def __init__(self,N):
        
        self.N = N
        self.A = [0]*(N+1)
        self.B = [0]*(N+1)
        self.C = [0]*(N+1)
        
        
    def add_val(self,a,b,l,r):
        
        ##ax+bを[l,r)に加算
        
        self.B[l] += a*l+b
        self.B[r] -= a*l+b
        self.A[l+1] += a
        self.A[r] -= a
        self.C[r] -= (r-l-1)*a
        
    
    def query(self):
        
        for i in range(self.N):
            self.B[i+1] += self.B[i]
            self.A[i+1] += self.A[i]
            
        for i in range(self.N):
            self.A[i+1] += self.A[i] + self.C[i+1]
            
        return [a+b for a,b in zip(self.A,self.B)][:-1]
        
N = int(input())
A = list(map(int,input().split()))
mod = 10**9 + 7
if 0 in A:
    print(0)
    exit()
    
    
l = 0
r = 0
S = 1
M = 10**9
il = imos_line(N)
Y = [0]*N

while r < N:
    
    if S*A[r] < M:
        S *= A[r]
        r += 1
    else:
        il.add_val(-1,r,l,r)
        S //= A[l]
        l += 1
for i in range(l,r):
    il.add_val(-1,r,i,r)
X = il.query()

ans = 1
for i,a in enumerate(A):
    ans *= pow(a,X[i],mod)
    ans %= mod
print(ans)