#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 2 * 1e5 + 100, M = 4096 + 10, len = 315, inf = 1e18;
const ll mod = 1e9 + 7;
ll um(ll a, ll b){
	return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
	return ((1LL * a - b) % mod + mod) % mod;
}
ll a[N], b[N], num[N], n;
void subtask1(){
	ll ans = 0;
	for(ll mask = 0; mask < (1 << n); mask++){
		for(ll dig = 0; dig < n; dig++){
			if((mask & (1 << dig)) > 0) num[dig] = a[dig];
			else num[dig] = b[dig];
		}
		vector <pll> vec;
		// for(ll i = 0; i < n; i++){
			// cout << num[i] << " ";
		// }
		// cout << endl;
		for(ll i = 0; i < n; i++){
			ll res = 0, last = -1, cnt = 0;
			while((ll)vec.size() != 0){
				pll v = vec.back();
				if(v.F <= num[i]){
					cnt += v.S;
					last = v.F;
					res += um(num[i] - v.F, v.S);
					vec.pop_back();
				} else break;
			}
			if((ll)vec.size() != 0) ans += res;
			else ans = ans + subr(res, um(cnt, num[i] - last));
			ans %= mod;
			vec.pb({num[i], cnt + 1});
		}
		//cout << ans << " HERE\n";
	}
	cout << ans;
}
pll sf[N], pr[N];
ll ls[N], rs[N], p[N], fen[N], was[N];
void upd(ll i, ll delta){
	for(; i < N; i = (i | (i+  1))){
		fen[i] += delta;
	}
}
ll get(ll r){
	ll res = 0;
	for(; r >= 0; r = (r & (r + 1)) - 1){
		res += fen[r];
	}
	return res;
}
void subtask2(){
	ll ans = 0;
	for(ll i = 0; i < n; i++){
		//cout << i << " INDEX\n";
		set <pll> mn;
		// This shit is not for me
		for(ll j = 1; j <= 1000; j++){
			was[j] = 0;
		}
		for(ll j = i + 1; j < n; j++){
			mn.insert({-b[j], j});
			upd(a[j], 1);
		}
		for(ll j = i + 1; j < n; j++){
			mn.erase({-b[j], j});
			upd(a[j], -1);
			ll mini = 0;
			if((int)mn.size() != 0) mini = -mn.begin()->F;
			if(mini > a[j]) sf[j].F = 0;
			else sf[j].F = p[get(a[j]) - was[a[j]]];
			
			if(mini > b[j]) sf[j].S = 0;
			else sf[j].S = p[get(b[j]) - was[b[j]]];
			//cout << sf[j].F << " "<< sf[j].S << endl;
			upd(a[j], 1);
			was[a[j]]++;
			mn.insert({-b[j], j});
		}
		for(ll j = i + 1; j < n; j++){
			rs[a[j]] += sf[j].F;
			rs[a[j]] %= mod;
			rs[b[j]] += sf[j].S;
			rs[b[j]] %= mod;
			
			upd(a[j], -1);
		}
		
		mn.clear();
		// bless you/ work please
		for(ll j = 1; j <= 1000; j++){
			was[j] = 0;
		}
		for(ll j = i - 1; j >= 0; j--){
			mn.insert({-b[j], j});
			upd(a[j], 1);
		}
		for(ll j = i - 1; j >= 0; j--){
			mn.erase({-b[j], j});
			upd(a[j], -1);
			ll mini = 0;
			if((int)mn.size() != 0) mini = -mn.begin()->F;
			if(mini >= a[j]) pr[j].F = 0;
			else pr[j].F = p[get(a[j]) - was[a[j]]];
			
			if(mini >= b[j]) pr[j].S = 0;
			else pr[j].S = p[get(b[j]) - was[b[j]]];
			//cout << pr[j].F << " "<< pr[j].S << endl;
			upd(a[j], 1);
			was[a[j]]++;
			mn.insert({-b[j], j});
		}
		for(ll j = i - 1; j >= 0; j--){
			ls[a[j]] += pr[j].F;
			ls[a[j]] %= mod;
			ls[b[j]] += pr[j].S;
			ls[b[j]] %= mod;
			
			upd(a[j], -1);
		}
		for(ll j = 1; j <= 1000; j++){
			for(ll k = 1; k <= 1000; k++){
				if(a[i] < min(k, j)) ans += um(min(k, j) - a[i], um(rs[j], ls[k]));
				if(b[i] < min(k, j)) ans += um(min(k, j) - b[i], um(rs[j], ls[k]));
				ans %= mod;
			}
		}
		for(ll j = 1; j <= 1000; j++){
			rs[j] = ls[j] = 0;
		}
		//cout << ans << " RESULT\n";
	}
	cout << ans;
}
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	cin >> n;
	p[0] = 1;
	for(ll i = 1; i <= n; i++){
		p[i] = um(p[i - 1], 2LL);
	}
	for(ll i = 0; i < n; i++){
		cin >> a[i];
	}
	for(ll i = 0; i < n; i++){
		cin >> b[i];
		if(b[i] > a[i]) swap(a[i], b[i]);
	}
	// if(n <= 20){
		// subtask1();
		// return 0;
	// }
	subtask2();
  return 0;
}