#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const ll INF=1e13;
const int N=3e5+10,mod=998244353;
int n;
ll l[N],r[N];
int top,stk[N];
bool chkL(int x,int y,int z){
	return (z-x)*(l[y]-l[x])-(l[z]-l[x])*(y-x)>0;
}
bool chkR(int x,int y,int z){
	return (y-x)*(r[z]-r[x])-(r[y]-r[x])*(z-x)>0;
}
int ta,tb,m;
struct zj{
	ll L,R;//[L,R)
	int id;
}a[N],b[N];
ll c[N*4];
ll upper(ll x,int y){
	if(y<0)y=-y,x=-x;
	if(x>=0)return (x+y-1)/y;
	else return x/y;
}
ll lower(ll x,int y){
	if(y<0)y=-y,x=-x;
	if(x>=0)return x/y;
	else return (x-y+1)/y;
}
int p[N*4],q[N*4];
int calc(ll l,ll r){
	if((r-l+1)%2==0)return ((r-l+1)/2%mod*((l+r)%mod)%mod+mod)%mod;
	else return ((l+r)/2%mod*((r-l+1)%mod)%mod+mod)%mod;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%lld",&l[i]);
	for(int i=1;i<=n;i++)scanf("%lld",&r[i]);
	l[0]=l[n+1]=-INF,r[0]=r[n+1]=INF;
	stk[top=1]=0;
	for(int i=1;i<=n+1;i++){
		for(;top>1&&!chkL(stk[top-1],stk[top],i);top--);
		stk[++top]=i;
	}
	// debug("L",ary(stk,2,top-1));
	for(int i=2;i<top;i++){
		int x=stk[i-1],y=stk[i],z=stk[i+1];
		a[++ta]={upper(l[z]-l[y],z-y),upper(l[y]-l[x],y-x)-1,stk[i]};
	}
	stk[top=1]=0;
	for(int i=1;i<=n+1;i++){
		for(;top>1&&!chkR(stk[top-1],stk[top],i);top--);
		stk[++top]=i;
	}
	// debug("R",ary(stk,2,top-1));
	for(int i=2;i<top;i++){
		int x=stk[i-1],y=stk[i],z=stk[i+1];
		b[++tb]={lower(r[y]-r[x],y-x)+1,lower(r[z]-r[y],z-y),stk[i]};
	}
	for(int i=1;i<=ta;i++)c[++m]=a[i].L,c[++m]=++a[i].R;
	for(int i=1;i<=tb;i++)c[++m]=b[i].L,c[++m]=++b[i].R;
	sort(c+1,c+1+m),m=unique(c+1,c+1+m)-c-1;
	auto trs=[&](ll &x){
		x=lower_bound(c+1,c+1+m,x)-c;
	};
	for(int i=1;i<=ta;i++){
		trs(a[i].L),trs(a[i].R);
		for(int j=a[i].L;j<a[i].R;j++)p[j]=a[i].id;
	}
	for(int i=1;i<=tb;i++){
		// debug("B",b[i].L,b[i].R,b[i].id);
		trs(b[i].L),trs(b[i].R);
		// debug("B",b[i].L,b[i].R,b[i].id);
		for(int j=b[i].L;j<b[i].R;j++)q[j]=b[i].id;
	}
	int ans=0;
	// debug("c",ary(c,1,m));
	// debug("p",ary(p,1,m));
	// debug("q",ary(q,1,m));
	for(int i=1;i<m;i++){
		if(!q[i]||!p[i])continue;
		ll l=c[i],r=c[i+1]-1,y=::r[q[i]]-::l[p[i]]+1,x=q[i]-p[i];
		if(x==0){
			if(y>=0)ans=(ans+(r-l+1)%mod*(y%mod))%mod;
		}else if(x>0){
			r=min(r,lower(y,x));
			if(l<=r)ans=(ans+(r-l+1)%mod*(y%mod)+(mod-calc(l,r))*x)%mod;
		}else{
			// debug("upper",y,x,upper(y,x));
			l=max(l,upper(y,x));
			if(l<=r)ans=(ans+(r-l+1)%mod*(y%mod)+(mod-calc(l,r))*x)%mod;
		}
		// debug("ans",ans);
	}
	cout<<ans<<endl;
	return 0;
}