SP201 POLYGAME - The Game of Polygons

Two players take part in the game **polygons**. A convex polygon with _n_ vertices divided by _n-3_ diagonals into _n-2_ triangles is necessary. These diagonals may intersect in vertices of the polygon only. One of the triangles is black and the remaining ones are white. Players proceed in alternate turns. Each player, when its turn comes, cuts away one triangle from the polygon. players are allowed to cut off triangles along the given diagonals. The winner is the player who cuts away the black triangle. NOTE: We call a polygon **convex** if a segment joining any two points of the polygon is contained in the polygon. ### Task Write a program which: - reads from the standard input the description of the polygon, - verifies whether the player who starts the game has a winning strategy, - writes the result to the standard output.

The number of test cases t is in the first line of input, then t test cases follow separated by an empty line. The first line of each test case contains an integer _n_, _4

The output for each test case should have one line with the word: - YES, if the player, who starts the game has a winning strategy, - NO, if he does not have a winning strategy.