#include <bits/stdc++.h>
#define int unsigned long long
using namespace std;
const int N = 100000 + 10;
const int mod = 998244353;
const int Mod = 998244352;
int n;
int p[N],k[N];
int ans = 1;
int pre[N],bck[N];
int read() {
	char ch;
	int sum = 0,flag = 1;
	ch = getchar();
	while(ch < '0' || ch > '9') {
		if(ch == '-') flag = -flag;
		ch = getchar();
	}
	while(ch >= '0' && ch <= '9') {
		sum = sum * 10 + ch - '0';
		ch = getchar();
	}
	return sum * flag;
}
int Pow(int x,int b){
	int res = 1;
	for(; b; b = b >> 1){if(b & 1) res = (res % mod * x % mod) % mod; x = (x * x) % mod;}
	return res % mod;
}
signed main(){
    n = read();
    for(int i = 1; i <= n; i++){
    	p[i] = read();
	}
	for(int i = 1; i <= n; i++){
		k[i] = read();
	}
	pre[0] = bck[n + 1] = 1;
	for(int i = 1; i <= n; i++){
		pre[i] = (pre[i - 1] % Mod * (k[i] + 1) % Mod) % Mod;
	}
	for(int i = n; i >= 1; i--){
		bck[i] = (bck[i + 1] % Mod * (k[i] + 1) % Mod) % Mod;
	}
	for(int i = 1; i <= n; i++){
		int c = (k[i] + 1) * k[i] / 2;
		int res = Pow(p[i],c) % mod;
		int ci = (bck[i + 1] % (mod - 1) * pre[i - 1] % (mod - 1)) % (mod - 1);
		ans = (ans % mod * Pow(res,ci) % mod) % mod; 
	}
	cout << ans % mod << endl;
	return 0;
}