문제

Bessie the cow has $N$ ($1\le N\le 2\cdot 10^5$) jobs for you to potentially complete. The $i$-th one, if you choose to complete it, must be started at or before time $s_i$ and takes $t_i$ time to complete ($0\le s_i\le 10^{18}, 1\le t_i\le 10^{18}$).

What is the maximum number of jobs you can complete? Time starts at $0$, and once you start a job you must work on it until it is complete, without starting any other jobs in the meantime.

입력

The first line contains $T$, the number of independent test cases ($1\le T\le 10$). Each test case is formatted as follows.

The first line contains $N$.

Each of the next $N$ lines contains two integers $s_i$ and $t_i$. Row $i+1$ has the details for the $i$th job.

It is guaranteed that the sum of $N$ over all test cases does not exceed $3\cdot 10^5$.

출력

For each test case, the maximum number of jobs you can complete, on a new line.

예제 입력 1

3
2
1 4
1 2
2
2 3
1 2
3
1 4
2 3
1 2

예제 출력 1

1
2
2

점수

Inputs 2: Within the same test case, all $t_i$ are equal.Inputs 3-4: $N\le 2000$, $s_i, t_i\le 2000$Inputs 5-8: $N\le 2000$Inputs 9-16: No additional constraints.