Hunter's Apprentice

When you were five years old, you watched in horror as a spiked devil murdered your parents. You would have died too, but Rose, a passing demon hunter, saved you. She adopted you and trained you as her apprentice.

Rose's current quarry is a clock devil that has been wreaking havoc on the otherwise quiet and unassuming town of Innsmouth. It comes out every night to damage goods, deface signs, and kill anyone foolish enough to wander around too late. It already killed the last demon hunter who went after it. Its time-warping powers make it incredibly agile, so it does well in a straight fight.

The two of you spent weeks searching through dusty tomes for a way to defeat this evil, and eventually you found a relevant passage. It described how a priest ensnared a clock devil with a trap built from silver, lavender, pewter, and clockwork. The finished trap has several pieces, which must be placed one at a time in the shape of a particular polygon, in counter-clockwise order. According to the book, the counter-clockwise order counters the clock devil's ability to speed up its own time, and a clockwise order would only make it faster.

Building and deploying the trap was your job, while Rose prepared for the fight. You carefully rebuilt each piece from the book as well as you could. Unfortunately, that night did not go as planned. Before you could finish preparing the trap, the clock devil found the two of you. Rose is fighting the devil and losing quickly, but she is buying you the time to finish the trap. You quickly walk around them in the shape of the polygon and place each piece in its correct position. You hurriedly activate the trap as Rose is knocked out. Just then, you remember the book's warning. What should you do next?

Given the positions of the pieces in the order you placed them, determine whether you placed them in counter-clockwise order.

The first line contains an integer $T$ ($1 \le T \le 100$), the number of test cases.

The first line of each test case contains an integer $n$ ($3 \le n \le 20$), the number of pieces in the trap. Each of the next $n$ lines contains two integers $x_i$ and $y_i$ ($|x_i|, |y_i| \le 100$), the x and y coordinates where the $i$-th piece was placed. The pieces are given in the order you placed them.

The polygon is guaranteed to be simple: edges intersect only at vertices, exactly two edges meet at each vertex, and all vertices are distinct.

For each test case, print one line: fight if the trap was made correctly (the pieces were placed in counter-clockwise order), or run if the trap was made incorrectly (clockwise order).

In the first test case, you went around the polygon in the correct direction, so it is safe to fight the clock devil and try to save Rose.

In the second test case, you messed up, and it is time to start running. Sorry, Rose!