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

#define int long long
const int MAXN = 1e5 + 5;
const int MOD = 998244353;

struct Segment {
	int l, r, c;

    bool operator<(const Segment &other) const {
        return r < other.r;
    }
};

int n;
int t[4 * MAXN][2];
int lazy[4 * MAXN][2];
Segment segments[MAXN];

inline void apply(int u, int tag, int type) {
    t[u][type] *= tag; t[u][type] %= MOD;
    lazy[u][type] *= tag; lazy[u][type] %= MOD;
}

inline void pushdown(int u, int l, int r, int type) {
    if(lazy[u][type] == 1) return;

    assert(l != r);

    apply(2 * u, lazy[u][type], type);
    apply(2 * u + 1, lazy[u][type], type);

    lazy[u][type] = 1;
}

void upd(int u, int l, int r, int pos, int v, int type) {
    if(pos < l || pos > r) return;

    if(l == r) {
        t[u][type] += v; t[u][type] %= MOD;
        return;
    }

    pushdown(u, l, r, type);
    int mid = (l + r) / 2;
    upd(2 * u, l, mid, pos, v, type); upd(2 * u + 1, mid + 1, r, pos, v, type);
    t[u][type] = t[2 * u][type] + t[2 * u + 1][type]; t[u][type] %= MOD;
}

void upd2(int u, int l, int r, int pos, int type) {
    if(pos < l) return;
    if(r <= pos) {
        apply(u, 2, type);
        return;
    }

    pushdown(u, l, r, type);
    int mid = (l + r) / 2;
    upd2(2 * u, l, mid, pos, type); upd2(2 * u + 1, mid + 1, r, pos, type);
    t[u][type] = t[2 * u][type] + t[2 * u + 1][type]; t[u][type] %= MOD;
}

int qry(int u, int l, int r, int pos, int type) {
    if(pos < l) return 0;
    if(r <= pos) return t[u][type];

    pushdown(u, l, r, type);
    int mid = (l + r) / 2;
    return (qry(2 * u, l, mid, pos, type) + qry(2 * u + 1, mid + 1, r, pos, type)) % MOD;
}


void solve() {
    cin >> n;

    for(int i = 0; i <= 4 * n; ++i) t[i][0] = t[i][1] = 0, lazy[i][0] = lazy[i][1] = 1;

    for(int i = 1; i <= n; ++i) {
        cin >> segments[i].l >> segments[i].r >> segments[i].c;
    }
    segments[0].l = segments[0].r = 0;

    sort(segments + 1, segments + 1 + n);
    upd(1, 0, n, 0, 1, 0); upd(1, 0, n, 0, 1, 1);

    int ans = 1;
    for(int i = 1; i <= n; ++i) {
        int lo = -1, hi = i;
        while(hi - lo > 1) {
            int mid = (lo + hi) / 2;
            if(segments[mid].r < segments[i].l) lo = mid;
            else hi = mid;
        }

        // cout << "LO: " << lo << endl;
        int type = segments[i].c;
        int val = qry(1, 0, n, lo, 1 - type);
        // cout << "VAL: " << val << endl;
        upd(1, 0, n, i, val, type); upd2(1, 0, n, lo, 1 - type);
        ans += val; ans %= MOD;

        // cout << "trees: " << endl;
        // for(int i = 1; i <= n; ++i) {
        //     cout << qry(1, 0, n, i, 0) << " ";
        // }
        // cout << endl;
        // for(int i = 1; i <= n; ++i) {
        //     cout << qry(1, 0, n, i, 1) << " ";
        // }
        // cout << endl;
    }
    cout << ans << "\n";
}

signed main() {
    cin.tie(0)->sync_with_stdio(false);
    int t; cin >> t;
    while(t--) solve();
}