import heapq

t = int(input())
for _ in range(t):
    n = int(input())
    # print(t, n)
    arr = []
    for i in range(n):
        a1, a2 = map(int, input().split())
        arr.append([a1, a2])
    arr.sort()
    flag = True
    for i in range(n):
        if not arr[i][0] <= i + 1 <= arr[i][1]:
            flag = False
    dic = {}
    if flag:
        while arr:
            a1, a2 = heapq.heappop(arr)
            if a1 in dic:
                if a2 == dic[a2]:
                    flag = False
                    break
                heapq.heappush(arr, [dic[a1] + 1, a2])
            else:
                dic[a1] = a2
    print(1 if flag else 0)