#include <bits/stdc++.h>
using namespace std;
const int md = int(1e9) + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> b(n);
for (int i = 0; i < n; i++) {
cin >> b[i];
}
vector<int> pw(n + 1);
pw[0] = 1;
for (int i = 1; i <= n; i++) {
pw[i] = 1LL * pw[i - 1] * 2 % md;
}
auto c = a;
c.insert(c.end(), b.begin(), b.end());
sort(c.begin(), c.end());
c.erase(unique(c.begin(), c.end()), c.end());
int m = int(c.size());
int ans = 0;
for (int j = 1; j < m; j++) {
int d = c[j] - c[j - 1];
vector<int> pre(n + 1);
pre[0] = 1;
for (int i = 0; i < n; i++) {
pre[i + 1] = 1LL * pre[i] * ((a[i] < c[j]) + (b[i] < c[j])) % md;
}
vector<int> suf(n + 1);
suf[n] = 1;
for (int i = n - 1; i >= 0; i--) {
suf[i] = 1LL * suf[i + 1] * ((a[i] < c[j]) + (b[i] < c[j])) % md;
}
int res = 0;
for (int i = 0; i < n; i++) {
res += 1LL * ((pw[i] - pre[i] + md) % md) * ((pw[n - i - 1] - suf[i + 1] + md) % md) * ((a[i] < c[j]) + (b[i] < c[j])) % md;
res %= md;
}
ans += 1LL * res * d % md;
ans %= md;
}
cout << ans << '\n';
return 0;
}
