Mountaineers Mr. Takahashi and Mr. Aoki recently trekked across a certain famous mountain range. The mountain range consists of N mountains, extending from west to east in a straight line as Mt. 1, Mt. 2, ..., Mt. N. Mr. Takahashi traversed the range from the west and Mr. Aoki from the east.  The height of Mt. i is h_i, but they have forgotten the value of each h_i. Instead, for each i (1 ≤ i ≤ N), they recorded the maximum height of the mountains climbed up to the time they reached the peak of Mt. i (including Mt. i). Mr. Takahashi's record is T_i and Mr. Aoki's record is A_i.  We know that the height of each mountain h_i is a positive integer. Compute the number of the possible sequences of the mountains' heights, modulo 10^9 + 7.  Note that the records may be incorrect and thus there may be no possible sequence of the mountains' heights. In such a case, output 0.
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
f=[-1]*n
ma=[-1]*n
f[0]=a[0]
for i in range(n-1):
    if a[i]!=a[i+1]:
        f[i+1]=a[i+1]
    else:
        ma[i+1]=a[i+1]
if f[-1]>=0 and f[-1]!=b[-1]:
    print(0)
    exit()
f[-1]=b[-1]
for i in range(n-1):
    if b[n-i-1]!=b[n-i-2]:
        if f[n-i-2]>=0 and f[n-i-2]!=b[n-i-2]:
            print(0)
            exit()
        f[n-i-2]=b[n-i-2]
    else:
        ma[n-i-2]=min(ma[n-i-2],b[n-i-2])
ans=1
mod=10**9+7
for i in ma:
    if i>=0:
        ans*=i
        ans%=mod
print(ans)
       
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
mod = 10**9+7
ans = 1
if n == 1 and t != a:
    print(0)
    exit()
for i in range(1,n-1):
    if t[i-1] == t[i] and a[i] == a[i+1]:
        ans = (ans*min(t[i],a[i]))%mod
    elif t[i-1] < t[i] and t[i] > a[i]:
        print(0)
        exit()
    elif a[i] > a[i+1] and t[i] < a[i]:
        print(0)
        exit()
print(ans)
