#include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2>& l, const pair<T1, T2>& r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2>& l, const pair<T1, T2>& r) { return make_pair(l.first - r.first, l.second - r.second); }
const lint MOD = 1e9 + 7, INF = 1e18, MAX_N = 200000;

template <std::int_fast64_t Modulus>
class modint
{
	using u64 = std::int_fast64_t;

public:
	u64 a;
	constexpr modint(const u64 x = 0) noexcept : a(x% Modulus) {}
	constexpr u64& value() noexcept { return a; }
	constexpr const u64& value() const noexcept { return a; }
	constexpr modint operator+(const modint rhs) const noexcept
	{
		return modint(*this) += rhs;
	}
	constexpr modint operator-(const modint rhs) const noexcept
	{
		return modint(*this) -= rhs;
	}
	constexpr modint operator*(const modint rhs) const noexcept
	{
		return modint(*this) *= rhs;
	}
	constexpr modint operator/(const modint rhs) const noexcept
	{
		return modint(*this) /= rhs;
	}
	constexpr modint& operator+=(const modint rhs) noexcept
	{
		a += rhs.a;
		if (a >= Modulus)
		{
			a -= Modulus;
		}
		return *this;
	}
	constexpr modint& operator-=(const modint rhs) noexcept
	{
		if (a < rhs.a)
		{
			a += Modulus;
		}
		a -= rhs.a;
		return *this;
	}
	constexpr modint& operator*=(const modint rhs) noexcept
	{
		a = a * rhs.a % Modulus;
		return *this;
	}
	constexpr modint& operator/=(modint rhs) noexcept
	{
		u64 exp = Modulus - 2;
		while (exp)
		{
			if (exp % 2)
			{
				*this *= rhs;
			}
			rhs *= rhs;
			exp /= 2;
		}
		return *this;
	}
};
typedef modint<MOD> ModInt;

lint N, A[100000], T[100000], dp[100000];
lint clear[100000];
int main() {
	cin.tie(0); ios_base::sync_with_stdio(false);
	cin >> N;
	REP(i, N) {
		cin >> T[i];
	}	
	REP(i, N) {
		cin >> A[i];
	}
	REP(i, N) {
		clear[i] = -1;
	}
	clear[0] = T[0];
	clear[N - 1] = A[N - 1];
	if (N == 1 && A[0] != T[0]) {
		cout << 0 << endl;
		return 0;
	}

	REP(i, N - 1) {
		if (T[i + 1] != T[i]) clear[i + 1] = T[i + 1];
	}
	IREP(i, N - 1) {
		if (A[i + 1] != A[i]) {
			if (clear[i] != -1 && clear[i] != A[i]) {
				cout << 0 << endl;
				return 0;
			}
			else {
				clear[i] = A[i];
			}
		}
	}
	REP(i, N) {
		if (clear[i] > A[i]) {
			cout << 0 << endl;
			return 0;
		}
		if (clear[i] > T[i]) {
			cout << 0 << endl;
			return 0;
		}
	}

	REP(i, N) dp[i] = INF;
	REP(i, N) {
		if (clear[i] != -1) {
			dp[i] = 1;
		}
	}
	lint tmp;
	REP(i, N) {
		if (clear[i] != -1) tmp = clear[i];
		else{
			dp[i] = tmp;
		}
	}
	IREP(i, N) {
		if (clear[i] != -1) tmp = clear[i];
		else{
			chmin(dp[i], tmp);
		}
	}
	ModInt ans = 1;
	REP(i, N) {
		ans *= dp[i];
	}
	cout << ans.a << endl;
}


Measured memory_bytes: 3328