#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <numeric>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <complex>
#include <climits>
#include <random>
using namespace std;

#define pb push_back
#define all(x) x.begin(), x.end()
#define ll long long

const int mod = (int) 1e9 + 7;

int n;
int a[500005];
int b[500005];
int step[500005];

int add(int x, int y){
    ll s = 0LL + x + y;
    if(s >= mod) s -= mod;
    if(s < 0) s += mod;
    return s;
}

int sub(int x, int y){
    return add(x, -y);
}

void sub5(){
    step[0] = 1;
    for(int i = 1; i <= n; i++){
        step[i] = (1LL * step[i - 1] * 2) % mod;
    }   
    int ans = 0;
    for(int i = 2; i <= n - 1; i++){
        int kek = sub(sub(sub(step[n - 1], sub(step[i - 1], 1)), sub(step[n - i], 1)), 1);
        ans = add(ans, kek);
    }
    cout << ans;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n;
    //n = 101;
    bool s5 = 1;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        //a[i] = 1;
        s5 &= (a[i] <= 2);
    }
    for(int i = 1; i <= n; i++){
        cin >> b[i];
        //b[i] = 2;
        s5 &= (b[i] <= 2);
    }
    if(s5){
        sub5();
        return 0;
    }
}