시간 제한메모리 제한제출정답맞힌 사람정답 비율
1 초 256 MB78373347.826%

## 문제

In ancient Rome, they used to hold elections by playing a game called Throw the Coin. A quick note for those of you studying Roman history is in order: this is not accurate – in actuality, they held elections by having their cats fight in the arena. Historical accuracy aside, the game of Throw the coin was a game in which the goal was to get as many allies as possible. At the end of the game, the person with the most allies would win. Note that these games were fixed most of the time, and the winner would normally be the one with the fiercest looking cat. With this in mind, it is actually more historically accurate than we meant for this problem statement to be. Also please kindly note that, while this paragraph is very long, we can assure you beyond reasonable as well as unreasonable doubt that it could absolutely have been much, much longer, well beyond the point at which it would be considered ridiculous by anyone possessing any degree of sanity at all.

Each player would bring a coin to the game, any coin, as long as it was perfectly circular and had an integer radius. The players would then throw their coins so that the center of each coin landed on integer coordinates in a coordinate system. They would then mark the area that was covered by each coin, and after everyone had thrown their coin, they would compare the area each coin had covered. A player would become allies with another player if the areas of their coins overlapped. Strangely, the areas were somehow guaranteed to never touch in only one single point.

N players have lined up to play. Your task is to figure out who won, i.e. who got the most allies.

## 입력

The first line of the input consists of a single integer, T, the number of test cases.

Each of the following T cases begins with a line with a single integer N.

Each of the next N lines consist of a player’s name, and three integers X, Y and R, representing the x- and y-coordinates of his throw, and the radius of his coin, respectively.

• 1 ≤ T ≤ 20
• 2 ≤ N ≤ 100
• −100 ≤ X, Y ≤ 100
• 1 ≤ R ≤ 10
• Each name consists of between 2 and 255 lowercase letters a-z

## 출력

For each test case output a single line with the name of the winning player or, in case of a tie, output TIE.

## 예제 입력 1

3
3
charlie 0 0 3
john 1 1 1
peter -1 -1 1
2
magne -100 -100 1
edvard 100 100 100
3
christian 0 0 10
christian 2 2 3
ruben -5 0 1


## 예제 출력 1

charlie
TIE
christian