#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>

using namespace std;
typedef long long ll;
char s[10000005];
#define M 998244353

ll arrnum(int n,int k)
{
    ll res=1;
    for(int i=0;i<k;i++)
        res=(res*(n-i))%M;
    return res;
}

int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,m,x,k,flag,b[100001],c[100001];
        ll res;
        bool vis[100001];
        memset(vis,0,sizeof(vis));
        scanf("%d",&n);
        for(int i=0;i<n;i++)
            scanf("%d",&b[i]);
        for(int i=0;i<n;i++)
            scanf("%d",&c[i]);
        if(b[0]!=c[0])
        {
            printf("0\n");
            continue;
        }
        flag=1;
        vis[b[0]]=true;
        res=1;
        m=0;
        for(int i=1;i<n&&flag;i++)
        {
            if(b[i]>b[i-1]||c[i]<c[i-1]||(b[i]<b[i-1]&&c[i]>c[i-1]))
            {
                flag=0;
                break;
            }
            if(b[i]<b[i-1])
            {
                vis[b[i]]=true;
                m++;
                continue;
            }
            if(c[i]>c[i-1])
            {
                vis[c[i]]=true;
                m++;
                continue;
            }
            k=0;
            while(i<n&&b[i]==b[i-1]&&c[i]==c[i-1])
            {
                k++;
                i++;
            }
            i--;
            res=res*arrnum(c[i]-b[i]-m,k)%M;
            m+=k;
        }
        if(flag==0)
        {
            printf("0\n");
            continue;
        }
        else
            printf("%I64d\n",res);
    }
    return 0;
}