Math

You have to distribute N bananas among some people according to the following conditions:

• You can choose the number of people that receive bananas.
• Each person should get more than one banana.
• One person cannot receive all the bananas.
• All the N bananas must be distributed.
• Each person can only receive an integral number of bananas.

Write a program to determine whether the bananas can be distributed among the people.

Input format

• First line: T (number of test cases)
• Next T lines: N

Output format

For each test case, print Yes or No depending upon the result.

Constraints

You are given a set $$S$$ containing $$N$$ points.

Write a program to find the number of points in the smallest subset of $$S$$ that has the same convex hull as that of $$S$$.

Note:

• All the points in the input are not collinear.
• No two points are the same.

Input format

• First line: $$N$$
• Next $$N$$ lines: Two space-separated integers $$x$$ and $$y$$ denoting the coordinates of

Output format

Print the number of points in the smallest subset of $$S$$ that has the same convex hull as that of $$S$$.

Constraints