#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;

using LL = long long;

template <class Node>
struct Segment_Tree {
    vector<vector<Node>> t;
    void init(int n) {
        t.resize(2);
        t[0].resize(n << 2);
        t[1].resize(n << 2);
        // build(1, 1, n,p);
    }
    void build(int x, int l, int r, int p) {
        t[p][x].l = l, t[p][x].r = r;
        if (l == r) {
            if (l == 0) {
                t[p][x].sum = 1;
            }
            else
                t[p][x].sum = 0;
            t[p][x].lazy = 1;
            return;
        }
        int mid = (l + r) >> 1;
        build(x << 1, l, mid, p);
        build(x << 1 | 1, mid + 1, r, p);
        t[p][x] = t[p][x << 1] + t[p][x << 1 | 1];
    }
    void updata(int x, int p) {
        if (t[p][x].lazy == 1)return;
        t[p][x << 1].sum *= t[p][x].lazy;
        t[p][x << 1].sum %= mod;
        t[p][x << 1 | 1].sum *= t[p][x].lazy;
        t[p][x << 1 | 1].sum %= mod;
        t[p][x << 1].lazy *= t[p][x].lazy;
        t[p][x << 1].lazy %= mod;
        t[p][x << 1 | 1].lazy *= t[p][x].lazy;
        t[p][x << 1 | 1].lazy %= mod;
        t[p][x].lazy = 1;
    }

    void push_up(int x, int p) {
        t[p][x] = t[p][x << 1] + t[p][x << 1 | 1];
    }

    void upd(int x, int v, int w, int p) {
        int lc = t[p][x].l, rc = t[p][x].r;
        if (lc == v && rc == v) {
            t[p][x].sum += w;
            t[p][x].sum %= mod;
            return;
        }
        // updata(x, p);
        int mid = (lc + rc) >> 1;
        if (v <= mid)upd(x << 1, v, w, p);
        else  upd(x << 1 | 1, v, w, p);
        push_up(x, p);
    }

    void change(int x, int l, int r, int w, int p) {
        int lc = t[p][x].l, rc = t[p][x].r;
        if (lc >= l && rc <= r) {
            t[p][x].sum *= w;
            t[p][x].sum %= mod;
            t[p][x].lazy *= w;
            t[p][x].lazy %= mod;
            return;
        }
        updata(x, p);
        int mid = (lc + rc) >> 1;
        if (l <= mid)change(x << 1, l, r, w, p);
        if (r > mid)change(x << 1 | 1, l, r, w, p);
        push_up(x, p);
    }

    Node sum(int x, int l, int r, int p) {
        int lc = t[p][x].l, rc = t[p][x].r;
        if (lc >= l && rc <= r) return t[p][x];
        updata(x, p);
        int mid = (lc + rc) >> 1;
        if (r <= mid) return sum(x << 1, l, r, p);
        if (l > mid) return sum(x << 1 | 1, l, r, p);
        return sum(x << 1, l, r, p) + sum(x << 1 | 1, l, r, p);
    }
};

struct Node {
    int l, r;
    LL lazy = 1, sum;
};
Node operator + (const Node& a, const Node& b) {
    Node c;
    c.l = a.l, c.r = b.r;
    c.lazy = 1;
    c.sum = a.sum + b.sum;
    c.sum %= mod;
    return c;
}

struct node {
    int l, r, c;
};
void solve() {
    int n;cin >> n;
    vector<node>a(n + 1);
    for (int i = 1;i <= n;i++) {
        cin >> a[i].l >> a[i].r >> a[i].c;
    }
    sort(a.begin() + 1, a.end(), [&](node a, node b) {
        return a.r < b.r;
    });
    a[0].l = a[0].r = 0;
    Segment_Tree<Node>tr;
    tr.init(n);
    tr.build(1, 0, n, 0);
    tr.build(1, 0, n, 1);
    // tr.change(1, 1, n - 1, 3, 0);
    // cout << tr.sum(1, 1, n, 0).sum << "\n";
    LL ans = 1;
    for (int i = 1;i <= n;i++) {
        int l = 0, r = i;
        while (l + 1 < r) {
            int mid = l + r >> 1;
            if (a[mid].r < a[i].l)l = mid;
            else r = mid;
        }
        // cout << l << "\n";
        LL res = tr.sum(1, 0, l, a[i].c ^ 1).sum;
        // cout << i << " " << res << "\n";
        tr.upd(1, i, res, a[i].c);
        tr.change(1, 0, l, 2, a[i].c ^ 1);
        ans += res;
        ans %= mod;
    }
    cout << ans << "\n";



}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int tt = 1;

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif
    cin >> tt;
    while (tt--)
        solve();
    return 0;
}