#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];
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int n;
	cin >> n;
	for(ll i = 0; i < n; i++){
		cin >> a[i];
	}
	for(ll i = 0; i < n; i++){
		cin >> b[i];
	}
	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;
  return 0;
}