EarthCup

In the year of 2045,the soccer championship is gradually replaced by Earth Super Soccer Cup(We will call it EarthCup for short later). For one EarthCup,there are $n(n\leq50000)$ soccer teams participated in. Every two teams will have a game. It means that every team will have $n-1$ games with all the other teams. In order to make the result clear, it is ruled that if the two teams of a game have the same score when the game ends.Penalty shootout will last until there is a result. In the EarthCup,every team has a Mark,and will score one point after winning a game and zero after losing a game. The team with the highest mark will be the champion. In the year of 2333, somebody found that some teams had hired hackers to attack and modified the data of the EarthCup for many years.Maybe because of the great amount of the teams, this serious cheating behavior has not been found during hundreds of years. To check whether the data was modified, they started to check the "Mark Table" in the past. But because of the long ages, there were only the final Mark of each team reserved. No one remember the exact result of each game.Now they want to find out some "Mark Table" that must have been modified. "Must have been modified" means we can not get this "Mark Table" by any exact result of each game according to the rules was given by.

There is an positive integer $T(T\leq50)$ standing for the number of testcases. For each testcase, there is an positive integer $n$ standing for the number of teams participate in EarthCup. The followed n lines describe the "Mark table". The $ith$ integer ${a}_{i}(0\leq {a}_{i} < n)$ standing for the final Mark of the $ith$ team.

For each testcase, output "The data have been tampered with!"(without quotation) if it must have been modified,otherwise output "It seems to have no problem."(without quotation).