Nasser's Card Game#13053
Nasser and Fady are playing a card game. Nasser has cards a_1, a_2, \dots, a_n, and Fady has cards b_1, b_2, \dots, b_n.
The cards are played on a pile strictly in the following alternating sequence:
A player immediately wins if they play a card with the exact same value as the card played right before it. If all cards are played without any match, the game ends in a tie.
Determine the winner of the game.
The first line contains a single integer (1 \le t \le 10^4) — the number of test cases.
The first line of each test case contains an integer (2 \le n \le 2 \cdot 10^5).
The second line contains integers a_1, a_2, \dots, a_n (1 \le a_i \le 10^9) — Nasser's cards.
The third line contains integers b_1, b_2, \dots, b_n (1 \le b_i \le 10^9) — Fady's cards.
It is guaranteed that the sum of over all test cases does not exceed 2 \cdot 10^5.
For each test case, output Nasser, Fady, or Tie.
Example 1
Subtask ( points): No additional constraints.