#include <iostream>
#include <iomanip>
#include <vector>
#include <valarray>
#include <map>
#include <set>
#include <list>
#include <queue>
#include <stack>
#include <bitset>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cassert>

#include <unordered_set>
#include <unordered_map>
#include <random>
#include <thread>
#include <chrono>

using namespace std;

#define val const auto
#define var auto

#define all(c) c.begin(), c.end()
#define repeat(i, n) for (int i = 0; i < static_cast<int>(n); i++)
#define debug(x) #x << "=" << (x)

#ifdef DEBUG
#define dump(x) std::cerr << debug(x) << " (L:" << __LINE__ << ")" << std::endl
#else
#define dump(x) 
#endif

typedef complex<double> point;

template<typename T,std::size_t N>
struct _v_traits {using type = std::vector<typename _v_traits<T,N-1>::type>;};
template<typename T>
struct _v_traits<T,1> {using type = std::vector<T>;};
template<typename T,std::size_t N=1>
using vec = typename _v_traits<T,N>::type;

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "{";
    for(auto it = v.begin(); it != v.end(); ++it){
        if(it != v.begin()){
            os << ",";
        }
        os << *it;
    }
    return os << "}";
}

template <typename T>
T read_next(){
    T ret; cin >> ret;
    return ret;
}


template<typename T>
void isort(std::vector<T>& v, std::function<bool(T,T)> comp=less<T>()){
    sort(v.begin(), v.end(), comp);
}
template<typename T>
std::vector<T> sort(std::vector<T> v, std::function<bool(T,T)> comp=less<T>()){
    isort(v);
    return v;
}
template<typename T1, typename T2>
std::vector<T2> rmap(const std::vector<T1>& v, std::function<T2(T1)> f){
    std::vector<T2> t; t.reserve(v.size());
    for(const auto& i: v) t.push_back(f(i));
    return t;
}
std::vector<std::string> split(std::string str, char delim){
    std::vector<std::string> res;
    size_t current = 0, found;
    while((found = str.find_first_of(delim, current)) != std::string::npos){
        res.push_back(std::string(str, current, found - current));
        current = found + 1;
    }
    res.push_back(std::string(str, current, str.size() - current));
    return res;
}
string join(const std::vector<string>& v, string delim){
    string ret = "";
    for(auto it = v.begin(); it != v.end(); ++it){
        if(it != v.begin()){
            ret += delim;
        }
        ret += *it;
    }
    return ret;
}


using i64 = int64_t;
using i32 = int32_t;

i64 MOD = 1000000007;
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int N; cin >> N;
    vector<i64> t(N), a(N);
    for(i64 &i : t) cin >> i;
    for(i64 &i : a) cin >> i;
    vector<tuple<i64, i64> > width(N);
    {
        i64 tb = -1;
        for(int i=0;i<t.size();i++){
            auto ti = t[i];
            if(tb < ti){
                width[i] = make_tuple(ti, ti+1);
            }else{
                width[i] = make_tuple(1, ti+1);
            }
            tb = ti;
        }
    }
    {
        i64 ab = -1;
        for(int i=N-1;i>=0;i--){
            auto ai = a[i];
            tuple<i64, i64> awid;
            if(ab < ai){
                awid = make_tuple(ai, ai+1);
            }else{
                awid = make_tuple(1, ai+1);
            }
            ab = ai;

            // test collisi
            auto twid = width[i];
            if(get<1>(twid) <= get<0>(awid) or
               get<1>(awid) <= get<0>(twid)){
                cout << 0 << endl;
                return 0;
            }else{
                width[i] = make_tuple(max(get<0>(awid), get<0>(twid)),
                                      min(get<1>(awid), get<1>(twid)));
            }
        }
    }
    i64 ret = 1;
    for(auto t : width){
        ret *= get<1>(t) - get<0>(t);
        ret %= MOD;
    }
    cout << ret << endl;

    return 0;
}


Measured memory_bytes: 3456