import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict
import bisect

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


def index_lt(a, x):
    'return largest index s.t. A[i] < x or -1 if it does not exist'
    return bisect.bisect_left(a, x) - 1


def index_le(a, x):
    'return largest index s.t. A[i] <= x or -1 if it does not exist'
    return bisect.bisect_right(a, x) - 1


def index_gt(a, x):
    'return smallest index s.t. A[i] > x or len(a) if it does not exist'
    return bisect.bisect_right(a, x)


def index_ge(a, x):
    'return smallest index s.t. A[i] >= x or len(a) if it does not exist'
    return bisect.bisect_left(a, x)


N = int(input())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7

if 0 in A:
    print(0)
    exit()

S = []
l = 0
r = 0
acc = 1
while r < N:
    acc *= A[r]
    if acc >= 10 ** 9:
        S.append((l, r))
    while acc >= 10 ** 9:
        acc //= A[l]
        l += 1
    r += 1
S.append((l, N))

ans = 1
for l, r in S:
    for i in range(l, r):
        ans *= pow(A[i], (i - l + 1) * (r - i), MOD)
        ans %= MOD
for (a, b), (c, d) in zip(S[:-1], S[1:]):
    l = max(a, c)
    r = min(b, d)
    for i in range(l, r):
        ans *= pow(pow(A[i], (i - l + 1) * (r - i), MOD), MOD - 2, MOD)
        ans %= MOD
print(ans)