#include <bits/stdc++.h>
using namespace std;

static auto __fast_io = []()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    return 0;
}();

// #define DEBUGx
#ifdef DEBUGx
#define TRC_PG(fmt, args...) fprintf(stderr, "\033[1;32m  TRC_PG(%s:%d):\t\033[0m" fmt, __func__, __LINE__, ##args)
#define TRC_PR(fmt, args...) fprintf(stderr, "\033[1;31m  TRC_PR(%s:%d):\t\033[0m" fmt, __func__, __LINE__, ##args)
#define debug fprintf(stderr, "Passing [%s] in LINE %d\t\n", __func__, __LINE__)
#endif
#ifndef DEBUGx
#define TRC_PG(...)
#define TRC_PR(...)
#define debug
#endif

template <typename _Tp>
_Tp qpow(_Tp a, _Tp b, _Tp m)
{
    _Tp t = a % m, ret = 1;
    while (b)
    {
        if (b & 1)
            ret = ret * t % m;
        b >>= 1, t = t * t % m;
    }
    return ret;
}

const long long MOD = 998244353;
const int MAX_M = 1e6 + 10;

long long sum[MAX_M], sum2[MAX_M];
long long p[MAX_M];
long long k[MAX_M];
long long ans;
int m;

void input()
{
    cin >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> p[i];
    }
    for (int i = 1; i <= m; i++)
    {
        cin >> k[i];
    }
    sum[0] = 1;
    for (int i = 1; i <= m; i++)
    {
        sum[i] = sum[i - 1] * (k[i] + 1) % (MOD - 1);
    }
    sum2[m + 1] = 1;
    for (int i = m; i >= 1; i--)
    {
        sum2[i] = sum2[i + 1] * (k[i] + 1) % (MOD - 1);
    }
}
void work()
{
    ans = 1;
    for (int i = 1; i <= m; i++)
    {
        long long d = ((k[i] + 1) * k[i] / 2) % (MOD - 1) * (sum[i - 1] * sum2[i + 1] % (MOD - 1));
        ans = ans * qpow(p[i] % MOD, d % (MOD - 1), MOD) % MOD;
    }
}
void output()
{
    cout << ans << "\n";
}

int main()
{
    // freopen("temp.txt", "r", stdin);
    input();
    work();
    output();
    return 0;
}

/*
2
5 11
2 3
821555742
*/