// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/*using ll = __int128;*/
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
/*const ll M = 998244353;*/
const ll M = 1e9 + 7;
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ff first
#define ss second
#define PI 3.141592653589793238462643383279502884L
const ll INFL = 1e18;
const int INF = 1e9;
const int maxN = 101+1;
int suf[102][1001], suf_sum[102][1001];
int pref[102][1001], pref_sum[102][1001];
int a[1001], b[1001];
void solve() {
int n;
cin >> n;
for (int i=1; i<=n; i++) cin >> a[i];
for (int i=1; i<=n; i++) cin >> b[i];
int mx = max(*max_element(a, a+n+1), *max_element(b, b+n+1));
pref[0][0] = 1;
for (int i=1; i<=n; i++) {
for (auto v: {a[i], b[i]}) {
for (int j=v+1; j<=mx; j++) {
pref[i][j] += pref[i-1][j];
pref[i][j] %= M;
}
for (int j=0; j<=v; j++) {
pref[i][v] += pref[i-1][j];
pref[i][j] %= M;
}
}
}
suf[n+1][0] = 1;
for (int i=n; i>=1; i--) {
for (auto v: {a[i], b[i]}) {
for (int j=v+1; j<=mx; j++) {
suf[i][j] += suf[i+1][j];
suf[i][j] %= M;
}
for (int j=0; j<=v; j++) {
suf[i][v] += suf[i+1][j];
suf[i][j] %= M;
}
}
}
ll ans = 0;
for (int i=1; i<=n; i++) {
for (auto v: {a[i], b[i]}) {
for (int j=v+1; j<=mx; j++) {
for (int k=v+1; k<=mx; k++) {
ans += 1ll*pref[i-1][j]*suf[i+1][k]*(min(j,k)-v);
ans %= M;
}
}
}
}
cout << ans << '\n';
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout << fixed << setprecision(12);
int tc = 1;
/*cin >> tc;*/
while (tc--) solve();
}
