#include <bits/stdc++.h>

using namespace std;

#define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
#define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
#define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
#define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
#define fixed(n) fixed << setprecision(n)
#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
#define fill(vec, value) memset(vec, value, sizeof(vec));
#define Num_of_Digits(n) ((int)log10(n) + 1)
#define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define sz(x) int(x.size())
#define debug(x) cout << #x << ": " << (x) << "\n";
#define fi first
#define se second
#define Pair pair < int, int >
#define ll long long
#define ull unsigned long long
#define Mod  1'000'000'007
#define OO 2'000'000'000
#define EPS 1e-9
#define PI acos(-1)

template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
    for (auto &x: v) in >> x;
    return in;
}

template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) { 
    for (const T &x: v) out << x << ' '; 
    return out;
}

void AhMeD_HoSSaM(){
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout); 
    #endif
}

vector < ll > fact(1e6 + 10, 1), inv(1e6 + 10, 1);

ll fast_power(ll b, ll e, ll MOD){
    ll power = 1;
    while(e){
        if(e & 1) power = mod_combine(power, b, MOD);
        e >>= 1, b = mod_combine(b, b, MOD);
    }
    return power % MOD;
}

ll Inverse(ll N, ll MOD){
    return fast_power(N, MOD - 2, MOD) % MOD;
}

void Power_Inverse(ll n, ll MOD){
    for(ll i = 1; i <= n; i++){
        fact[i] = mod_combine(fact[i - 1], i, MOD);
        inv[i] = Inverse(fact[i], MOD);
    }
}

void Solve(){
    Power_Inverse(1e6, 1e9 + 7);
    int n;
    cin >> n;
    vector < ll > a(n), b(n), steps(n);
    cin >> a >> b;
    ll total = 0;
    for(int i = 0; i < n; i++){
        if(abs(b[i] - a[i]) % (i + 1))
            return void(cout << 0 << '\n');
        steps[i] += abs(b[i] - a[i]) / (i + 1);
        total += steps[i];
    }
    ll ans = fact[total];
    for(auto& s : steps)
        ans = ((ans % Mod) * (inv[s] % Mod)) % Mod;
    cout << ans << '\n';
}

int main(){
    AhMeD_HoSSaM();
    int t = 1;
    //cin >> t;
    while(t--)
        Solve();
    return 0;
}