#include <iostream>
#include <vector>
#include <string>
#include <iomanip>
#include <queue>
#include <cmath>
#include <algorithm>
#include <tuple>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <queue>
#include <unordered_set>


//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC optimize("O3")
//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("section-anchors")
//#pragma GCC optimize("profile-values,profile-reorder-functions,tracer")
//#pragma GCC optimize("vpt")
//#pragma GCC optimize("rename-registers")
//#pragma GCC optimize("move-loop-invariants")
//#pragma GCC optimize("unswitch-loops")
//#pragma GCC optimize("function-sections")
//#pragma GCC optimize("data-sections")
//#pragma GCC optimize("branch-target-load-optimize")
//#pragma GCC optimize("branch-target-load-optimize2")
//#pragma GCC optimize("btr-bb-exclusive")
//#pragma GCC optimize("O0")


#define int long long
#define ll long long
#define ull unsigned long long
#define all(a) a.begin(), a.end()
#define pii pair<int, int>
#define pb push_back
#define ld long double


using namespace std;

const int INF = 1e18;
//const int mod = 2600000069;
//const int p = 179;

bool comp(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
    if (a.first.first < b.first.first) return 1;
    else if (a.first.first > b.first.first) return 0;
    if (a.first.second < b.first.second) return 1;
    else if (a.first.second > b.first.second) return 0;
    if (a.second > b.second) return 1;
    return 0;
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int q;
    cin >> q;
    while(q--) {
        int n;
        cin >> n;
        vector<pair<pair<int, int>, int>> a(n);
        for (int i = 0; i < n; i++) {
            cin >> a[i].first.first >> a[i].first.second >> a[i].second;
        }
        sort(all(a), comp);
        vector<int> dp(n);
        dp[0] = a[0].first.first + a[0].second;
        bool ok = 0;
        for (int i = 1; i < n; i++) {
            if (ok) break;
            if (max(dp[i-1], a[i].first.first) + a[i].second > a[i].first.second) {
                cout << 0 << "\n";
                ok = 1;
            }
        }
        if (!ok) cout << 1 << "\n";
    }
}