#include <bits/stdc++.h>
  
using namespace std;
  
#if 1
    #define pv(x) cout<<#x<<" = "<<(x)<<"; ";cout.flush()
    #define pn cout<<endl
#else
    #define pv(x)
    #define pn
#endif
  
// #if 1
#ifdef INFOARENA
    ifstream in("xerox.in");
    ofstream out("xerox.out");
#else
    #define in cin
    #define out cout
#endif
  
using ll = long long;
using ull = unsigned long long;
using uint = unsigned int;
using ld = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pld = pair<ld, ld>;
#define pb push_back
const long double PI = 3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862;
const int inf_int = 1e9 + 5;
const ll inf_ll = 1e18 + 5;
const int NMax = 2e2 + 5;
const int SGMax = NMax * NMax;
const int mod = 1e9 + 7;
const int dx[] = {-1,0,0,+1}, dy[] = {0,-1,+1,0};

int sg[NMax];
bool have[SGMax];

int main() {
    cin.sync_with_stdio(false);
    cin.tie(0);
    
    for (int i = 1; i <= 200; ++i) {
        for (int x = 1; x <= i; ++x) {
            for (int inside = 0; inside <= (i - x) - inside; ++inside) {
                int outside = (i - x) - inside;
                if ((sg[inside] ^ sg[outside]) >= SGMax)  {
                    // assert(false);
                    continue;
                }
                have[sg[inside] ^ sg[outside]] = true;
            }
        }

        int mex = 0;
        while (have[mex]) {
            ++mex;
            // assert(mex < SGMax);
        }

        sg[i] = mex;
    }

    int T;
    in >> T;
    while (T--) {
        int N;
        in >> N;
        int xorsum = 0;
        for (int i = 1; i <= N; ++i) {
            int M;
            in >> M;
            for (int j = 1; j <= M; ++j) {
                int x,y;
                in >> x >> y;
            }

            xorsum ^= sg[M];
        }

        out << ((xorsum) ? '1' : '0') << '\n';
    }

    // for (int i = 1; i <= 10; ++i) {
    //     pv(i);pv(sg[i]);pn;  //////
    // }
    
    return 0;
}