#include <bits/stdc++.h>

using namespace std;
#define all(a)a.begin(),a.end()
using ll=long long;
const int INF = 1<<30;
const ll INFll =1LL<<62;
const int mod= int(1e9)+7;
//const int mod=998244353;
using P = pair<int,int>;
using Pll = pair<ll,ll>;
using ld=long double;

// modint: mod 計算を int を扱うように扱える構造体
template<int MOD> struct Fp {
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
using mint = Fp<1000000007>;

int main() {
    mint ans=1;
    ll n;cin >>n;
    vector<ll>t(n);
    vector<ll>a(n);
    for (int i = 0; i <n; ++i) {
        cin >> t[i];
    }
    for (int j = 0; j < n; ++j) {
        cin >>a[j];
    }
    vector<ll>h(n,-1);
    ll mx=-1;
    vector<ll>hh(n);
    for (int i = 0; i < n; ++i) {
        if(t[i]>mx){
            h[i]=t[i];
            mx=t[i];
        }
        hh[i]=mx;
    }
    mx=-1;
    bool flg=false;
    for(int i=n-1;i>=0;i--){
        if(a[i]>mx){
            if((h[i]!=-1)&&(h[i]!=a[i])){
                flg=true;
            }
            h[i]=a[i];
            mx=a[i];
        }
        hh[i]=min(hh[i],mx);
    }
    for (int i = 0; i < n; ++i) {
        if((h[i]!=-1)&&(h[i]>t[i])){
            flg=true;
        }
    }
    if(flg){
//        cout <<"!"<<endl;
        cout <<0<<endl;
        return 0;
    }
    for (int k = 0; k < n; ++k) {
        if(h[k]<0){
            ans*=hh[k];
        }
    }
//    for (int l = 0; l < n; ++l) {
//        cout <<h[l]<<" ";
//    }
//    cout <<endl;
    cout <<ans <<endl;
}


Measured memory_bytes: 6436