#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
const int N = 1e5+1;
void solve() {
int n;
cin >> n;
vi a(n),b(n);
for (int i=0;i<n;i++) cin >> a[i];
for (int i=0;i<n;i++) cin >> b[i];
int ans = 0;
int lim = (1<<n);
for (int i = 0;i<lim;i++){
int mx = 0;
for (int j = 0;j<n;j++) {
if (i&(1<<j)) mx = max(mx,b[j]);
else mx = max(mx,a[j]);
ans+=mx;
}
}
for (int i = 0;i<lim;i++){
int mx = 0;
for (int j = n-1;j>=0;j--) {
if (i&(1<<j)) mx = max(mx,b[j]);
else mx = max(mx,a[j]);
ans+=mx;
}
}
for (int i = 0;i<lim;i++){
int mx = 0;
for (int j = n-1;j>=0;j--) {
if (i&(1<<j)) mx = max(mx,b[j]);
else mx = max(mx,a[j]);
}
ans-=mx*n;
}
for (int i = 0;i<n;i++) ans-=(lim>>1)*(a[i]+b[i]);
cout << ans%MOD << '\n';
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef Dodi
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
