#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 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);
}

int mul(int x, int y){
    ll s = 1LL * x * y;
    return (s % mod);
}

int n;
ll a[500005][2];
ll step[500005];
ll suf[10005][5];
ll pref[10005][5];

void sub1234(){
    ll ans = 0;
    set<int> d;
    for(int i = 0; i < n; i++){
        for(int j = 0; j <= 1; j++){
            d.insert(a[i][j]);
        }
    }
    for(auto x : d){
        pref[0][0] = 1;
        pref[0][1] = pref[0][2] = 0;
        for(int i = 0; i < n; i++){
            pref[i + 1][0] = pref[i + 1][1] = pref[i + 1][2] = 0;
            for(int j = 0; j <= 1; j++){
                if(a[i][j] < x){
                    pref[i + 1][0] += pref[i][0];
                    pref[i + 1][1] += pref[i][1];
                    pref[i + 1][2] += pref[i][2];
                }
                else if(a[i][j] == x){
                    pref[i + 1][1] += pref[i][0];
                    pref[i + 1][1] += pref[i][1];
                    pref[i + 1][2] += pref[i][2];
                }
                else{
                    pref[i + 1][2] += (pref[i][0] + pref[i][1] + pref[i][2]);
                }
                for(int k = 0; k < 3; k++) pref[i + 1][k] %= mod;
            }
        }
        suf[n][0] = 1;
        suf[n][1] = suf[n][2] = 0;
        for(int i = n - 1; i >= 0; i--){
            suf[i][0] = suf[i][1] = suf[i][2] = 0;
            for(int j = 0; j <= 1; j++){
                if(a[i][j] < x){
                    suf[i][0] += suf[i + 1][0];
                    suf[i][1] += suf[i + 1][1];
                    suf[i][2] += suf[i + 1][2];
                }
                else if(a[i][j] == x){
                    suf[i][1] += suf[i + 1][0];
                    suf[i][1] += suf[i + 1][1];
                    suf[i][2] += suf[i + 1][2];
                }
                else{
                    suf[i][2] += (suf[i + 1][0] + suf[i + 1][1] + suf[i + 1][2]);
                }
                for(int k = 0; k < 3; k++) suf[i][k] %= mod;
            }
        }
        ll add = 0;
        for(int i = 1; i < n - 1; i++){
            int c = (pref[i][1] * suf[i + 1][1] + pref[i][2] * suf[i + 1][1] + pref[i][1] * suf[i + 1][2]) % mod;
            int total = max(0LL, x - a[i][0]) + max(0LL, x - a[i][1]);
            add = (add + (c * total) % mod) % mod;
        }
        ans = (ans + add) % mod;
    }
    cout << ans;
}

void sub5(){
    step[0] = 1;
    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;
    for(int i = 1; i <= n; i++){
        step[i] = (1LL * step[i - 1] * 2) % mod;
    }   
    bool s5 = 1;
    for(int k = 0; k <= 1; k++){
        for(int i = 0; i < n; i++){
            cin >> a[i][k];
            s5 &= (a[i][k] <= 2);
        }
    }
    /*
    if(s5){
        sub5();
        return 0;
    }
    */
    sub1234();
}