C language

Point The axes of a two-dimensional Cartesian system divide the plane into four infinite regions, called quadrants each bounded by two half-axes. These are often numbered from 1st to 4: where the signs of the (x;y) coordinates are l (+,+), ll (-, Ill (-;-), and iV (+,-). Given N points. Check that there is a point after removal of which the remaining points are located at most on one side of quadrant. Format Input The input begins with an integer T indicating the number of test cases. In each test case, the first line contains a single positive integer N, the number of points. The following N lines contain coordinates of the points. The i-th of these lines contains two single integers x, and y. No two points coincide Format Output For each test case, output YES if there is such a point. Otherwise, output NO Constraints 1