#include<bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
long long n,p[100001],k[100001],suma[100001],sumb[100002],mod=998244353,phi=998244352,ans=1;
long long FastReadLongLong()
{
	long long x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-')
		{
			f=-1;
		}
		c=getchar();
	}
	while(c>='0'&&c<='9')
	{
		x=(x<<1)+(x<<3)+(c^48),c=getchar();
	}
	return x*f;
}
long long QuickPow(long long a,long long b,long long p)
{
	long long res=1;
	while(b)
	{
		if(b&1)
		{
			res=(res*a)%p;
		}
		a=(a*a)%p;
		b>>=1;
	}
	return res;
}
int main(){
	n=FastReadLongLong();
	for(int i=1;i<=n;i++)
	{
		p[i]=FastReadLongLong();
	}
	suma[0]=sumb[n+1]=1;
	for(int i=1;i<=n;i++)
	{
		k[i]=FastReadLongLong();
		suma[i]=((suma[i-1]*(((k[i]+1)%phi)+phi))%phi)+phi;
	}
	for(int i=n;i>=1;i--)
	{
		sumb[i]=((sumb[i+1]*(((k[i]+1)%phi)+phi))%phi)+phi;
	}
	for(int i=1;i<=n;i++)
	{
		ans=(ans*QuickPow(QuickPow(p[i],k[i]*(k[i]+1)/2,mod),suma[i-1]*sumb[i+1],mod))%mod;
	}
	printf("%lld",ans);
	return 0;
}