#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n, tests;
    scanf("%d", &tests);
    for (int test = 0; test < tests; test++)
    {
        scanf("%d", &n);
        vector<pair<pair<int, int>, int> > events(n);
        for (int i = 0; i < n; i++)
        {
            int s, f, t;
            scanf("%d%d%d", &s, &f, &t);
            events[i] = make_pair(make_pair(f - t, t), s);
        }
        sort(events.begin(), events.end());
        int T = 0;
        int ans = 1;
        for (int i = 0; i < n; i++)
        {
            if (T < events[i].second) T = events[i].second;
            if (T + events[i].first.second > events[i].first.first + events[i].first.second)
            {
                ans = 0;
                break;
            }
            T += events[i].first.second;
        }
        printf("%d\n", ans);
    }
}