CF1396B.Stoned Game

T is playing a game with his friend, HL.

There are $n$ piles of stones, the $i$-th pile initially has $a_i$ stones.

T and HL will take alternating turns, with T going first. In each turn, a player chooses a non-empty pile and then removes a single stone from it. However, one cannot choose a pile that has been chosen in the previous turn (the pile that was chosen by the other player, or if the current turn is the first turn then the player can choose any non-empty pile). The player who cannot choose a pile in his turn loses, and the game ends.

Assuming both players play optimally, given the starting configuration of $t$ games, determine the winner of each game.

T 正在与他的朋友 HL 玩一个游戏。

共有 $n$ 堆石子，其中第 $i$ 堆初始时有 $a_i$ 颗石子。

T 和 HL 轮流进行操作，T 先手。在每一轮中，当前玩家需选择一个非空的石子堆，并从中移除恰好一颗石子。但有一个限制：不能选择上一轮对方所选的那堆石子（若当前为第一轮，则可任选任意一个非空石子堆）。当某位玩家在自己的回合中无法选择任何石子堆时，该玩家判负，游戏结束。

假设双方均以最优策略进行游戏，给定 $t$ 局游戏各自的初始局面，请判断每局游戏中获胜的一方。

The first line of the input contains a single integer $t$ $(1 \le t \le 100)$ — the number of games. The description of the games follows. Each description contains two lines:

The first line contains a single integer $n$ $(1 \le n \le 100)$ — the number of piles.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ $(1 \le a_i \le 100)$.

输入的第一行包含一个整数 $t$（$1 \le t \le 100$）——游戏的场数。随后是各场游戏的描述。每场游戏的描述包含两行：

第一行包含一个整数 $n$（$1 \le n \le 100$）——堆的数量。

第二行包含 $n$ 个整数 $a_1, a_2, \dots, a_n$（$1 \le a_i \le 100$）。

For each game, print on a single line the name of the winner, "T" or "HL" (without quotes)

对于每局游戏，在一行中输出获胜者的名字，“T”或“HL”（不带引号）

In the first game, T removes a single stone from the only pile in his first turn. After that, although the pile still contains $1$ stone, HL cannot choose from this pile because it has been chosen by T in the previous turn. Therefore, T is the winner.

在第一局游戏中，T 在他的第一回合从唯一的一堆石子中移除一颗石子。此后，尽管该堆中仍剩 $1$ 颗石子，但 HL 无法从这堆中选择，因为该堆已在上一回合被 T 选过。因此，T 获胜。