using System;
using System.Text;
using System.Collections.Generic;
using System.Collections;
using System.Linq;
using E = System.Linq.Enumerable;
class Program2
{
    static char[] alpha = "ABCDEFGHIJKLMNOPQRSTUVWXYZ".ToCharArray();
    static void Main(string[] args)
    {
        Solve();
    }
    static long ans = 1;
    static long[] map = new long[13];
    static void Solve()
    {
        //var NM = Console.ReadLine().Split(' ').Select(x => long.Parse(x)).ToArray();
        var N = long.Parse(Console.ReadLine());
        var T = Console.ReadLine().Split(' ').Select(x => long.Parse(x)).ToArray();
        var A = Console.ReadLine().Split(' ').Select(x => long.Parse(x)).ToArray();
        var Def = new long[N];

        var Anow = 0L;
        for (int i = (int)N - 1; i >= 0; i--)
        {
            if (A[i] > Anow)
            {
                Anow = A[i];
                Def[i] = Anow;
            }
        }
        var ans = new Modular(1);
        var Tnow = 0L;
        for (int i = 0; i < N; i++)
        {
            var upd = false;
            if (T[i] > Tnow)
            {
                Tnow = T[i];
                if (Def[i] > 0 && Def[i] != Tnow)
                {
                    ans = 0;
                }
            }else if (Def[i] > 0)
            {
                if (Def[i] > T[i])
                {
                    ans = 0;
                }
            }
            else
            {
                ans *= Math.Min(T[i], A[i]);
            }

        }

        Console.WriteLine(ans.value);
    }

}
class Modular
{
    private const int M = 1000000007;
    public long value;
    public Modular(long value) { this.value = value; }
    public static implicit operator Modular(long a)
    {
        var m = a % M;
        return new Modular((m < 0) ? m + M : m);
    }
    public static Modular operator +(Modular a, Modular b)
    {
        return (a.value + b.value) % M;
    }
    public static Modular operator -(Modular a, Modular b)
    {
        return a.value - b.value;
    }
    public static Modular operator *(Modular a, Modular b)
    {
        return a.value * b.value;
    }
    public static Modular Pow(Modular a, int n)
    {
        switch (n)
        {
            case 0:
                return 1;
            case 1:
                return a;
            default:
                var p = Pow(a, n / 2);
                return p * p * Pow(a, n % 2);
        }
    }
    public static Modular operator /(Modular a, Modular b)
    {
        return a * Pow(b, M - 2);
    }
    private static readonly List<int> facs = new List<int> { 1 };
    private static Modular Fac(int n)
    {
        for (int i = facs.Count; i <= n; ++i)
        {
            facs.Add((int)(Math.BigMul(facs.Last(), i) % M));
        }
        return facs[n];
    }
    public static Modular Ncr(int n, int r)
    {
        return (n < r) ? 0
             : (n == r) ? 1
                        : Fac(n) / (Fac(r) * Fac(n - r));
    }
    public static explicit operator int(Modular a)
    {
        return (int)a.value;
    }

    public static Modular Lcm(Modular a, Modular b)
    {
        var tmp = Gcdl(a.value, b.value);
        return ((a * b) / new Modular(tmp));
    }
    static Modular Gcd(Modular m, Modular n)
    {
        if (n.value > m.value) return Gcd(n, m);
        if (n.value == 0) return m;
        var r = new Modular(m.value % n.value);
        return Gcd(n, r);
    }

    static long Gcdl(long m, long n)
    {
        if (n > m) return Gcdl(n, m);
        if (n == 0) return m;
        return Gcdl(n, m % n);
    }
}



Measured memory_bytes: 45880