#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &&x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define INSEG(l,x,r) ((l)<=(x)&&(x)<(r))
#define dump(...)
#define pb push_back
#define _ 0
const signed INF_=1001001001; const long long INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a,const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a,const U &b){return a>b?a=b,1:0;}
template <class T> void PSUM(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct before_main_function {
    before_main_function() {
        cin.tie(0); ios::sync_with_stdio(false);
        cout << setprecision(15) << fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

const int MOD = 1e9 + 7;
int bin_pow_mod(int a, int b, int mod) {
    int ret = 1;
    while (b > 0) {
        if (b & 1) ret = (ret * a) % mod;
        a = (a * a) % mod;
        b >>= 1;
    }
    return ret;
}
template <int mod = 1000000007>
class ModInt {
public:
    ModInt() : v(0) {}
    ModInt(int x) : v((x+mod)%mod) {}
    int value() const {return v;}
    const ModInt operator+(const ModInt &r) const { return ModInt(this->v + r.v); }
    const ModInt operator-(const ModInt &r) const { return ModInt(this->v + mod - r.v); }
    const ModInt operator*(const ModInt &r) const { return ModInt(this->v * r.v); }
    const ModInt operator/(const ModInt &r) const { return (*this * (~r)); }
    const ModInt operator~() const { return ModInt(bin_pow_mod(this->v, mod-2, mod)); }
    bool operator==(const ModInt &r) const { return this->v == r.v; }
    bool operator!=(const ModInt &r) const { return this->v != r.v; }
    ModInt& operator+=(const ModInt &r) { return *this = *this + r; }
    ModInt& operator-=(const ModInt &r) { return *this = *this - r; }
    ModInt& operator*=(const ModInt &r) { return *this = *this * r; }
    ModInt& operator/=(const ModInt &r) { return *this = *this * (~r); }
private:
    int v;
};
using Mint = ModInt<>;
signed main() {
    int N;
    cin >> N;
    vector<int> T(N);
    cin >> T;
    vector<int> A(N);
    cin >> A;

    int M;
    {
        int mxa = (*max_element(ALL(A)));
        int mxt = (*max_element(ALL(T)));
        if (mxa != mxt) {
            cout << 0 << endl;
            return 0;
        }
        M = mxa;
    }

    int tmx = 0;
    REP(i, N) if (T[i] > T[tmx]) tmx = i;
    int amx = N - 1;
    REPR(i, N - 1) if (A[i] > A[amx]) amx = i;
    if (amx < tmx) {
        cout << 0 << endl;
        return 0;
    }

    Mint ans = 1;
    // Takahashi
    REP(i, tmx) {
        if (i == 0) continue;
        if (T[i] > T[i - 1]) {
            // T[i]固定
        } else {
            ans *= T[i];
        }
    }
    REPR(i, N - 2) {
        if (i <= amx) break;
        if (A[i] > A[i + 1]) {
            // A[i]固定
        } else {
            ans *= A[i]; 
        }
    }
    int len = amx - tmx + 1;
    ans = ans * Mint(bin_pow_mod(M, max(len - 2, 0LL), MOD));
    cout << ans.value() << endl;
    return (0^_^0);
}



Measured memory_bytes: 1920