A monobilliards table set up in a gaming club turned out to be quite profitable,but only till the day the famous Mr. Saxena came to the town. Saxena was winning again and again, and the owner Pallu was counting his losses suspecting that something was wrong. But he couldn't prove the cheating until a very capable inspector Mr Shah arrived in the town. The rules of the game are very simple. One has to pocket successively the balls with numbers 1, 2, …, N into the only pocket (exactly in this order). While Mr. Saxena was playing, the inspector Shah several times came up to the table and took out from the table's pocket the last of the pocketed balls. In the end it turned out that Saxena had pocketed all the balls and Mr Shah had taken out and inspected them. Saxena claimed he had pocketed the balls in the right order! The owner Pallu understood that this was his chance, because Mr Shah had to remember the order in which he had taken out the balls. But would it be so easy to prove the cheating?

Input:
The first line contains the number of test cases T. T test cases follow,the first line of each test case denoting the number of balls. The first line contains the number of billiard balls N.In the next N lines there are the numbers of the balls in the order in which the inspector took them out from the pocket.

Ouput:
On a separate line for each test case,output the word "Cheater" if Saxena could not pocket all the N balls in the right order, otherwise output "Not a proof"

Constraints:
1 ≤ T ≤ 10
1 ≤ N ≤ 100000