#include <iostream>
#include <algorithm>
constexpr int N(300010),p(998244353),inv2((p+1)/2);
using ll=long long;
constexpr ll lim(1e12);
void ucv(ll *b,int n,int *id,int &m)
{
	m=0;
	id[++m]=1;
	for(int i(2);i<=n;++i)
	{
		while(m>=2 && (id[m]-id[m-1])*(b[i]-b[id[m]])<=(i-id[m])*(b[id[m]]-b[id[m-1]])) --m;
		id[++m]=i;
	}
}
ll xc(ll v,ll d)
{
	if(v>=0) return (v+d-1)/d;
	else return v/d;
}
ll xf(ll v,ll d)
{
	if(v>=0) return v/d;
	else return (v-d+1)/d;
}
int sum(ll l,ll r,int k,ll b)
{
	int t((r-l+1)%p);
	return (t*(b%p)+1ll*t*((l+r)%p)%p*inv2%p*k)%p;
}
int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n;std::cin>>n;
	static ll ls[N],tmp[N],rs[N];int cl(0),cr(0);
	static int rc[N],lc[N];
	for(int i(1);i<=n;++i) std::cin>>ls[i],tmp[i]=-ls[i];
	ucv(tmp,n,lc,cl);
	for(int i(1);i<=n;++i) std::cin>>rs[i],tmp[i]=rs[i];
	ucv(tmp,n,rc,cr);
	std::reverse(lc+1,lc+cl+1);
	// for(int i(1);i<=cl;++i) std::cerr<<lc[i]<<" ";std::cerr<<std::endl;
	// for(int i(1);i<=cr;++i) std::cerr<<rc[i]<<" ";std::cerr<<std::endl;
	int pl(1),pr(1),ans(0);
	auto calc=[&](ll l,ll r,int uk,ll ub,int dk,ll db)->void
	{
		// std::cerr<<"calc"<<l<<" "<<r<<" "<<uk<<" "<<ub<<" "<<dk<<" "<<db<<std::endl;
		if(uk==dk)
		{
			if(ub>=db && r>=l) ans=(ans+(r-l+1)%p*((ub-db+1)%p))%p;
		}
		else if(uk>dk)
		{
			l=std::max(xc(db-ub,uk-dk),l);
			if(r>=l)
			{
				ans=((ll)ans+sum(l,r,uk,ub)-sum(l,r,dk,db-1)+p)%p;
			}
		}
		else
		{
			r=std::min(xf(ub-db,dk-uk),r);
			if(r>=l)
			{
				ans=((ll)ans+sum(l,r,uk,ub)-sum(l,r,dk,db-1)+p)%p;
			}
		}
	};
	ll pos(-lim);
	// int idx(0);
	while(true)
	{
		ll nxt(lim);
		if(pl<cl)
		{
			nxt=std::min(nxt,xc(ls[lc[pl]]-ls[lc[pl+1]],lc[pl]-lc[pl+1]));
			// std::cerr<<lc[pl]<<" "<<lc[pl+1]<<" "<<ls[lc[pl]]-ls[lc[pl+1]]<<std::endl;
		}
		if(pr<cr)
		{
			nxt=std::min(nxt,xc(rs[rc[pr+1]]-rs[rc[pr]],rc[pr+1]-rc[pr]));
			// std::cerr<<rc[pr]<<" "<<rc[pr+1]<<" "<<rs[rc[pr+1]]-rs[rc[pr]]<<std::endl;
		}
		// std::cerr<<pos<<" "<<nxt<<" "<<pl<<" "<<pr<<std::endl;
		// if((++idx)>10) break;
		calc(pos,nxt-1,-(rc[pr]-1),rs[rc[pr]],-(lc[pl]-1),ls[lc[pl]]);
		if(pl==cl && pr==cr) break;
		if(pl<cl)
		{
			if(-lc[pl]*nxt+ls[lc[pl]]<=-lc[pl+1]*nxt+ls[lc[pl+1]]) ++pl;
		}
		if(pr<cr)
		{
			// std::cerr<<rc[pr]*nxt+rs[rc[pr]]<<" "<<rc[pr+1]*nxt+rs[rc[pr+1]]<<std::endl;
			if(-rc[pr]*nxt+rs[rc[pr]]>=-rc[pr+1]*nxt+rs[rc[pr+1]]) ++pr;
		}
		pos=nxt;
	}
	std::cout<<ans<<std::endl;
	return 0;
}