Migrated from Lutece 232 Find the most

All parts of this problem, including description, images, samples, data and checker, might be broken. If you find bugs in this problem, please contact the admins.

Description

When wangkun is doing the cleaning in 912, he finds out a lot of used coordinate paper with many points on it. Wangkun wants to have some fun with the points. He wants to find one point with two integers $x,y$, and he will use $(x,y)$ as the coordinate of the origin. Then he will draw a straight line parallel to the horizontal axis and a straight line parallel to the longitudinal axis, so the plane is divided into four quadrants. He wants to know how many points are there in the upper right region and the lower left region. The points in those two lines are not counted in.

So please help wangkun choose the $x$ and the $y$ to get the maximum number of points in the upper left region and the lower left region.

The point as origin must be one of the $n$ points which are given.

Input

The first line of the input is an integer $T$, which represents that there are $T$ test cases.

The next line of each case is an integer $n$, representing there are $n$ points. $(1 \leq n \leq 100)$

Each of the following $n$ lines contains two integers: $x, y$. $(1 \leq x \leq 1000000, 1 \leq y \leq 1000000)$

Output

Please output one integer, represents the number of maximum points wangkun could get in those two regions.

Samples

1
1
213 123

0

Resources

第四届北京邮电大学程序设计竞赛决赛