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

const int N = 2e5 + 10, mod = 998244353;

int power(int a, int b) {
    int ret = 1;
    while (b) {
        if (b & 1) {
            ret = 1ll * ret * a % mod;
        }
        a = 1ll * a * a % mod; b >>= 1;
    }
    return ret;
}
int fac[N], inv[N];
int C(int n, int m) {
    if (n < 0 || m < 0 || n < m) {
        return 0;
    }
    return 1ll * fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int n, a[N], b[N];

void solve() {
    cin >> n;
    bool flag = 1;
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
        if (a[i] != -1) {
            if (a[i] + b[i] != i) {
                flag = 0;
            }
            if (i < n && max(a[i], b[i]) >= 11 && abs(a[i] - b[i]) >= 2) {
                flag = 0;
            }
            if (i == n && !(max(a[i], b[i]) >= 11 && abs(a[i] - b[i]) >= 2))  {
                flag = 0;
            }
        }
    }
    if (n < 11 || !flag) {
        cout << "0\n";
        return;
    }
    if (n > 20 && (n & 1)) {
        cout << "0\n";
        return;
    }
    if (11 <= n && n <= 20) {
        if (a[n] != -1 && (a[n] != 11 || b[n] != n - 11)) {
            cout << "0\n"; return;
        }
        else {
            a[n] = 11, b[n] = n - 11;
        }
        if (a[n - 1] != -1 && (a[n - 1] != 10 || b[n - 1] != n - 11)) {
            cout << "0\n"; return;
        }
        else {
            a[n - 1] = 10, b[n - 1] = n - 11;
        }
    }
    for (int i = 20; i + 1 < n; i += 2) {
        if (a[i] != b[i]) {
            cout << "0\n";
            return;
        }
        a[i] = b[i] = i / 2;
    }
    if (n > 20) {
        a[n] = (n - 2) / 2, b[n] = a[n] + 2;
    }
    else {
        a[n] = 11, b[n] = n - 11;
        if (a[n - 1] != -1) {
            if (a[n - 1] < b[n - 1]) {
                swap(a[n - 1], b[n - 1]);
            }
            if (a[n - 1] != 10 || b[n - 1] != b[n]) {
                cout << "0\n";
                return;
            }
        }
        a[n - 1] = 10, b[n - 1] = b[n];
    }
    int last = 0, lasta = 0, lastb = 0;
    int ans = 1;
    for (int i = 1; i <= n; i++) {
        if (a[i] == -1) {
            continue;
        }
        int s1 = C(i - last, a[i] - lasta);
        int s2 = C(i - last, a[i] - lastb);
        if (a[i] == b[i]) {
            ans = 1ll * ans * s1 % mod;
        }
        else {
            ans = 1ll * ans * (s1 + s2) % mod;
        }
        last = i, lasta = a[i], lastb = b[i];
    }
    cout << ans << endl;
}

int main() {
    // freopen("in.in", "r", stdin);
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    fac[0] = 1;
    for (int i = 1; i <= 200000; i++) {
        fac[i] = 1ll * fac[i - 1] * i % mod;
    }
    inv[200000] = power(fac[200000], mod - 2);
    for (int i = 199999; i >= 0; i--) {
        inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
    }
    int T; cin >> T;
    while (T--) {
        solve();
    }
}