#include<bits/stdc++.h>
using namespace std;
#ifdef DEBUG
#include"debug.h"
#else
#define debug(...) void()
#endif
#define all(x) (x).begin(),(x).end()
template<class T>
auto ary(T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
using ll=long long;
using ull=unsigned ll;
const int N=5e5+10,mod=1e9+7,inv[3]={0,1,(mod+1)/2};
int n,pw,a[2][N],t[N];
tuple<int,int,int>p[N+N];
namespace SGT{
	int t[N<<2],mul[N<<2];
	void pushup(int rt){
		t[rt]=(t[rt<<1]+t[rt<<1|1])%mod;
	}
	void pushmul(int rt,int x){
		t[rt]=1ll*t[rt]*x%mod;
		mul[rt]=1ll*mul[rt]*x%mod;
	}
	void pushdown(int rt){
		if(mul[rt]^1){
			pushmul(rt<<1,mul[rt]);
			pushmul(rt<<1|1,mul[rt]);
			mul[rt]=1;
		}
	}
	void build(int l=1,int r=n,int rt=1){
		mul[rt]=1;
		if(l==r)return t[rt]=pw,void();
		int mid=(l+r)>>1;
		build(l,mid,rt<<1);
		build(mid+1,r,rt<<1|1);
		pushup(rt);
	}
	void update(int L,int R,int x,int l=1,int r=n,int rt=1){
		if(L<=l&&r<=R)return pushmul(rt,x);
		int mid=(l+r)>>1;
		pushdown(rt);
		if(L<=mid)update(L,R,x,l,mid,rt<<1);
		if(mid<R)update(L,R,x,mid+1,r,rt<<1|1);
		pushup(rt);
	}
	int query(int L,int R,int l=1,int r=n,int rt=1){
		if(L<=l&&r<=R)return t[rt];
		int mid=(l+r)>>1,s=0;
		pushdown(rt);
		if(L<=mid)s+=query(L,R,l,mid,rt<<1);
		if(mid<R)s+=query(L,R,mid+1,r,rt<<1|1);
		return s%mod;
	}
}
int calc(){
	SGT::build();
	int ans=0;
	fill(t+1,t+1+n,2);
	for(int i=1;i<=n+n;i++){
		auto [val,c,id]=p[i];
		ans=(ans+1ll*SGT::query(id,n)*inv[t[id]]%mod*val)%mod;
		SGT::update(id,n,inv[t[id]]*(t[id]-1ll)%mod);
		t[id]--;
		// debug(c,id,ans);
	}
	// debug("calc",ans);
	return ans;
}
int solve(){
	int ans=0,res=pw;
	fill(t+1,t+1+n,2);
	for(int i=1;i<=n+n&&res;i++){
		auto [val,c,id]=p[i];
		res=1ll*res*inv[t[id]]%mod;
		ans=(ans+1ll*res*val%mod*n)%mod;
		res=res*--t[id]%mod;
		// debug(c,id,ans);
	}
	return ans;
}
int main(){
	scanf("%d",&n);
	for(int i=pw=1;i<=n;i++)(pw*=2)%=mod;
	for(int c:{0,1}){
		for(int i=1;i<=n;i++){
			scanf("%d",&a[c][i]);
			p[i+c*n]={a[c][i],c,i};
		}
	}
	sort(p+1,p+1+n+n),reverse(p+1,p+1+n+n);
	int ans=calc();
	for(int c:{0,1})reverse(a[c]+1,a[c]+1+n);
	(ans+=calc())%=mod;
	(ans+=mod-solve())%=mod;
	for(int c:{0,1}){
		for(int i=1;i<=n;i++){
			ans=(ans+1ll*(mod-a[c][i])*pw%mod*inv[2])%mod;
		}
	}
	cout<<ans<<endl;
	return 0;
}
#ifdef DEBUG
#include"debug.hpp"
#endif