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.


-----Input-----

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)$.


-----Output-----

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


-----Example-----
Input
2
1
2
2
1 1

Output
T
HL



-----Note-----

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.

Difficulty: MEDIUM_HARD
Tags: Greedy algorithms

Complete search

Game theory

Constructive algorithms
Skill types: Complete search

Greedy algorithms

Starter code:

Solutions:
for _ in range(int(input())):
	np = int(input())
	nsp = list(map(int, input().split()))
	m = max(nsp)
	ts = sum(nsp)
	if m > ts // 2:
		print('T')
	elif ts % 2:
		print('T')
	else:
		print('HL')


T = int(input())
for t in range(1, T + 1):
	N = int(input())
	A = [int(s) for s in input().split()]
	sumA = sum(A)
	maxA = max(A)
	if sumA % 2 == 1 or 2 * maxA > sumA:
		print('T')
	else:
		print('HL')


import sys
input = sys.stdin.readline
T = int(input())
for t in range(T):
	N = int(input())
	A = [int(_) for _ in input().split()]
	if N == 1:
		print('T')
		continue
	sA = sorted(A, reverse=True)
	if sum(sA[1:]) < sA[0]:
		print('T')
	elif sum(sA) % 2:
		print('T')
	else:
		print('HL')


from sys import stdin, stdout
from math import gcd, sqrt, factorial, pi, inf
from collections import deque, defaultdict
from bisect import bisect, bisect_left
from time import time
from itertools import permutations as per
input = stdin.readline
R = lambda : map(int, input().split())
I = lambda : int(input())
S = lambda : input().rstrip('\r\n')
L = lambda : list(R())
P = lambda x: stdout.write(str(x) + '\n')
lcm = lambda x, y: x * y // gcd(x, y)
nCr = lambda x, y: f[x] * inv(f[y] * f[x - y] % N) % N
inv = lambda x: pow(x, N - 2, N)
sm = lambda x: (x ** 2 + x) // 2
N = 10 ** 9 + 7
for _ in range(I()):
	n = I()
	a = sorted(R())
	if n == 1 or a[-1] > sum(a[:-1]) or sum(a) % 2:
		print('T')
	else:
		print('HL')


for ad in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	l.sort()
	l.reverse()
	if n == 1:
		print('T')
		continue
	elif n == 2:
		if l[0] > l[1]:
			print('T')
		else:
			print('HL')
		continue
	t = 0
	i = 0
	j = 0
	while True:
		l.sort(reverse=True)
		if t == 0:
			if l[0] > 0:
				l[0] -= 1
			else:
				i = 1
				break
			if l[1] > 0:
				l[1] -= 1
			else:
				j = 1
				break
	if i == 1:
		print('HL')
	else:
		print('T')


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	m = max(l)
	if sum(l) - m < m:
		print('T')
	elif sum(l) % 2 == 1:
		print('T')
	else:
		print('HL')


import sys
sys.setrecursionlimit(10 ** 5)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep='\n')

def II():
	return int(sys.stdin.readline())

def MI():
	return map(int, sys.stdin.readline().split())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number):
	return [LI() for _ in range(rows_number)]

def SI():
	return sys.stdin.readline()[:-1]

def win():
	if n == 1:
		return True
	if n == 2:
		if aa[0] == aa[1]:
			return False
		return True
	s = sum(aa)
	if 2 * max(aa) > s or s % 2:
		return True
	return False
for _ in range(II()):
	n = II()
	aa = LI()
	if win():
		print('T')
	else:
		print('HL')


def solve():
	n = int(input())
	a = list(map(int, input().split()))
	maxPile = max(a)
	numStones = sum(a)
	if maxPile * 2 > numStones or numStones & 1:
		print('T')
	else:
		print('HL')

def main():
	t = int(input())
	for i in range(t):
		solve()
	return
main()


cases = int(input())
for t in range(cases):
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		if a[0] == 0:
			print('HL')
		else:
			print('T')
	else:
		a = sorted(a)
		if a[-1] > sum(a[:-1]):
			print('T')
		else:
			s = 0
			for i in range(n):
				s += a[i] - 1
			if s % 2 == 0:
				if n % 2 == 0:
					print('HL')
				else:
					print('T')
			elif n % 2 == 0:
				print('T')
			else:
				print('HL')


testCases = int(input())
winner = 'HL'
for x in range(testCases):
	numberOfPiles = int(input())
	piles = list(map(int, input().split()))
	total = sum(piles)
	if total % 2 == 1:
		winner = 'T'
	else:
		for y in piles:
			if y > total // 2:
				winner = 'T'
				break
	print(winner)
	winner = 'HL'


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	t = sum(a)
	flag = 0
	for i in range(n):
		if 2 * a[i] > t:
			flag = 1
			break
	if t % 2 == 1:
		flag = 1
	if flag == 1:
		print('T')
	else:
		print('HL')


def checkWin(a, summ):
	if summ % 2 == 1:
		return 'T'
	for i in range(n):
		if a[i] > summ - a[i]:
			return 'T'
	return 'HL'

def simulate(a):
	popped = True
	turn = 0
	while True:
		a.sort()
		if len(a) == 0 or (len(a) == 1 and (not popped)):
			if turn == 0:
				return 'HL'
			else:
				return 'T'
		a[0] -= 1
		if a[0] == 0:
			a.pop(0)
			popped = True
		else:
			popped = False
		turn = (turn + 1) % 2
T = int(input())
for t in range(T):
	n = int(input())
	a = []
	s = input().split()
	summ = 0
	for i in range(n):
		a.append(int(s[i]))
		summ += a[i]
	print(checkWin(a, summ))


for i in range(int(input())):
	n = int(input())
	piles = list(map(int, input().split()))
	if sum(piles) < 2 * max(piles):
		print('T')
	elif sum(piles) % 2 == 0:
		print('HL')
	else:
		print('T')


import sys
input = sys.stdin.readline
cases = int(input())
for tt in range(cases):
	n = int(input())
	a = [int(x) for x in input().split()]
	flag = False
	s = 0
	if n == 1:
		print('T')
		continue
	if n == 2:
		if a[0] != a[1]:
			print('T')
		else:
			print('HL')
		continue
	for i in range(n):
		s += a[i]
	for i in range(n):
		if a[i] > s // 2:
			flag = True
	if not flag:
		if s % 2 == 0:
			print('HL')
		else:
			print('T')
	else:
		print('T')


for _ in range(int(input())):
	n = int(input())
	a = [int(__) for __ in input().split()]
	a.sort()
	sum_ = sum(a)
	if a[-1] > sum_ - a[-1]:
		print('T')
	elif sum_ % 2 == 0:
		print('HL')
	else:
		print('T')


t = int(input())
for _ in range(t):
	n = int(input())
	arr = [int(x) for x in input().split()]
	arr.sort(reverse=True)
	maxa = arr[0]
	if maxa > sum(arr) - maxa:
		print('T')
		continue
	else:
		sum1 = sum(arr)
		if sum1 % 2 == 0:
			print('HL')
		else:
			print('T')


t = int(input())
for i in range(t):
	n = int(input())
	data = list(map(int, input().split()))
	data = sorted(data, reverse=True)
	sd = sum(data[1:])
	if data[0] > sd:
		print('T')
	elif data[0] == sd:
		print('HL')
	else:
		temp = sd - data[0]
		if temp % 2 == 0:
			print('HL')
		else:
			print('T')


import math
ans = []
for test in range(int(input())):
	num_of_piles = int(input())
	piles = input()
	piles = [int(x) for x in piles.split(' ')]
	half_sum = math.floor(sum(piles) / 2)
	winner = ''
	for pile in piles:
		if pile > half_sum:
			winner = 'T'
	if winner == '':
		if sum(piles) % 2 != 0:
			winner = 'T'
		else:
			winner = 'HL'
	ans.append(winner)
for i in ans:
	print(i)


t = int(input())
while t:
	t -= 1
	n = int(input())
	l = list(map(int, input().split()))
	m = max(l)
	s = sum(l)
	if s % 2 or 2 * m > s:
		print('T')
	else:
		print('HL')


from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush, heappop, heapify
import math
from collections import *
from functools import reduce, cmp_to_key
import sys
input = sys.stdin.readline
from itertools import accumulate
from functools import lru_cache
M = mod = 998244353

def factors(n):
	return sorted(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0))))

def inv_mod(n):
	return pow(n, mod - 2, mod)

def li():
	return [int(i) for i in input().rstrip('\n').split()]

def st():
	return input().rstrip('\n')

def val():
	return int(input().rstrip('\n'))

def li2():
	return [i for i in input().rstrip('\n')]

def li3():
	return [int(i) for i in input().rstrip('\n')]
sys.setrecursionlimit(10 ** 7)
for _ in range(val()):
	n = val()
	l = li()
	ma = max(l)
	s = sum(l)
	print('T' if ma > s - ma else 'T' if s & 1 else 'HL')


import sys
cases = True

def c2(n):
	return n * (n - 1) // 2

def get():
	return list(map(int, input().split()))

def bits(n: int):
	return list(bin(n)).count('1')

def main(test_case=False):
	n = int(input()) if test_case else 1
	for _ in range(n):
		test()

def flush():
	sys.stdout.flush()

def parr(arr):
	print(*arr, sep=' ')

def gcd(a, b):
	while b:
		if b % a == 0:
			break
		tmp = a
		a = b % a
		b = tmp
	return a

def ext_gcd(a: int, b: int):
	if b == 0:
		return [a, [1, 0]]
	res = ext_gcd(b, a % b)
	g = res[0]
	x1 = res[1][0]
	y1 = res[1][1]
	x = y1
	y = x1 - y1 * (a // b)
	return [g, [x, y]]

def test():
	n = get()
	a = sorted(get())
	if 2 * a[-1] > sum(a):
		print('T')
	else:
		print('T' if sum(a) % 2 else 'HL')
main(cases)


for _ in range(int(input())):
	n = int(input())
	a = sorted([int(i) for i in input().split()])
	if n == 1:
		print('T')
	else:
		summ = 0
		for i in range(n - 1):
			summ += a[i]
		if a[n - 1] > summ:
			print('T')
		else:
			summ += a[n - 1]
			if summ % 2 == 0:
				print('HL')
			else:
				print('T')


import sys
from collections import defaultdict as dd
from collections import Counter as cc
from queue import Queue
import math
import itertools
try:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
except:
	pass
input = lambda : sys.stdin.buffer.readline().rstrip()
for _ in range(int(input())):
	q = int(input())
	w = list(map(int, input().split()))
	k = sum(w)
	l = 1
	if q == 1:
		print('T')
	elif q == 2:
		if max(w) == min(w):
			print('HL')
		else:
			print('T')
	elif max(w) > k - max(w):
		print('T')
	elif max(w) == k - max(w):
		print('HL')
	elif (k - 2 * max(w)) % 2 == 1:
		print('T')
	else:
		print('HL')


from functools import lru_cache
from sys import stdin, stdout
import sys
from math import *
sys.setrecursionlimit(int(200000.0 + 10))
for __ in range(int(input())):
	n = int(input())
	ar = list(map(int, input().split()))
	m = max(ar)
	s = sum(ar)
	if s % 2 == 1:
		print('T')
	elif m > s - m:
		print('T')
	else:
		print('HL')


import sys
reader = (s.rstrip() for s in sys.stdin)
input = reader.__next__

def gift():
	for _ in range(t):
		n = int(input())
		arry = list(map(int, input().split()))
		if n == 1:
			yield 'T'
		elif n == 2:
			if arry[0] != arry[1]:
				yield 'T'
			else:
				yield 'HL'
		else:
			sumN = sum(arry)
			maxNum = max(arry)
			if maxNum > sumN - maxNum:
				yield 'T'
			elif sumN % 2:
				yield 'T'
			else:
				yield 'HL'
t = int(input())
ans = gift()
print(*ans, sep='\n')


t = int(input())
for _ in range(t):
	ok = False
	n = int(input())
	a = [int(s) for s in input().split(' ')]
	if max(a) > sum(a) - max(a):
		ok = True
		print('T')
	if not ok:
		if sum(a) % 2 == 0:
			print('HL')
		else:
			print('T')


for _ in range(int(input())):
	(n, lst, sam, man) = (int(input()), list(map(int, input().split(' '))), 0, 0)
	for i in lst:
		(sam, man) = (sam + i, max(man, i))
	print('T' if sam & 1 or n == 1 or man > sam - man else 'HL')


for _ in range(int(input())):
	(n, sum, arr) = (int(input()), 0, [int(i) for i in input().split()])
	for i in range(n):
		sum = sum + arr[i]
	arr.sort()
	if arr[n - 1] * 2 > sum or sum % 2:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	m = max(a)
	s = sum(a) - max(a)
	if m <= s and m % 2 == s % 2:
		print('HL')
	else:
		print('T')


t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	if n == 1:
		print('T')
	elif n == 2:
		if arr[0] > arr[1]:
			print('T')
		else:
			print('HL')
	else:
		x = 0
		y = 0
		z = 0
		while z == 0:
			arr.sort(reverse=True)
			if arr[0] > 0:
				arr[0] -= 1
			else:
				x = 1
				break
			if arr[1] > 0:
				arr[1] -= 1
			else:
				y = 1
				break
		if x == 1:
			print('HL')
		else:
			print('T')


for _ in range(int(input())):
	input()
	a = list(map(int, input().split()))
	print('T' if max(a) * 2 > sum(a) or sum(a) % 2 == 1 else 'HL')


t = int(input())
a = []
while t > 0:
	t -= 1
	n = int(input())
	a = list(map(int, input().split()))
	mx = 0
	sum = 0
	for i in range(n):
		if a[i] > mx:
			mx = a[i]
		sum += a[i]
	if mx << 1 > sum:
		print('T')
	else:
		print('T' if sum & 1 else 'HL')


for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	m = max(a)
	s = sum(a)
	if n == 1 or s < 2 * m or s % 2 != 0:
		print('T')
	else:
		print('HL')


import math
from sys import stdin
g = lambda : stdin.readline().strip()
gl = lambda : g().split()
gil = lambda : [int(var) for var in gl()]
gfl = lambda : [float(var) for var in gl()]
gcl = lambda : list(g())
gbs = lambda : [int(var) for var in g()]
mod = int(1000000000.0) + 7
inf = float('inf')
(t,) = gil()
for _ in range(t):
	(n,) = gil()
	a = gil()
	(m, s) = (max(a), sum(a))
	if m > s - m:
		print('T')
	elif s & 1:
		print('T')
	else:
		print('HL')


from sys import stdin
for _ in range(int(stdin.readline())):
	n = int(stdin.readline())
	arr = list(map(int, stdin.readline().split()))
	arr.sort()
	if n == 1:
		print('T')
		continue
	while len(arr) > 1:
		(a, b) = (arr[-1], arr[-2])
		arr = arr[:-2]
		a -= 1
		b -= 1
		if a != 0:
			arr.append(a)
		if b != 0:
			arr.append(b)
		arr.sort()
	if len(arr) > 0:
		print('T')
	else:
		print('HL')


t = int(input())
for _ in range(t):
	n = input()
	a = [int(i) for i in input().split()]
	maxi = max(a)
	s = sum(a)
	if s < 2 * maxi or s % 2 == 1:
		print('T')
	else:
		print('HL')


import sys
import math

def readStr():
	return sys.stdin.readline().rstrip()

def readInts():
	return list(map(int, readStr().split(' ')))

def readLatins():
	return [ord(c) - 97 for c in readStr()]

def main(n, a):
	s = sum(a)
	m = max(a)
	if m > s - m:
		return 'T'
	if s % 2 == 0:
		return 'HL'
	else:
		return 'T'
(t,) = readInts()
for _ in range(t):
	(n,) = readInts()
	a = readInts()
	x = main(n, a)
	print(x)


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort()
	l = sum(a[:-1])
	if a[-1] > l:
		print('T')
	elif abs(l - a[-1]) % 2 == 0:
		print('HL')
	else:
		print('T')


def checkMax(pilesArr, n):
	pilesArr.sort()
	pilesArrSum = sum(pilesArr)
	if pilesArr[-1] > pilesArrSum - pilesArr[-1]:
		return 'T'
	else:
		if pilesArrSum % 2 == 0:
			return 'HL'
		return 'T'
testCases = input()
for i in range(int(testCases)):
	numOfPiles = int(input())
	pilesArr = list(map(int, input().split()))
	ans = checkMax(pilesArr, numOfPiles)
	print(ans)


for _ in range(int(input())):
	n = int(input())
	arr = [int(x) for x in input().split()]
	arr.sort()
	s = sum(arr)
	if arr[n - 1] * 2 > s or s % 2:
		print('T')
	else:
		print('HL')


import os
from sys import stdin, stdout

def solve(tc):
	n = int(stdin.readline().strip())
	seq = list(map(int, stdin.readline().split()))
	if n == 1:
		print('T')
		return
	maxnum = 0
	cnt = 0
	for num in seq:
		cnt += num
		maxnum = max(maxnum, num)
	if maxnum * 2 > cnt:
		print('T')
		return
	if cnt % 2:
		print('T')
	else:
		print('HL')
tcs = 1
tcs = int(stdin.readline().strip())
tc = 1
while tc <= tcs:
	solve(tc)
	tc += 1


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(i) for i in input().split()]
	if n == 1:
		print('T')
		continue
	elif n == 2:
		if a[0] == a[1]:
			print('HL')
		else:
			print('T')
		continue
	total = sum(a)
	if total % 2 or max(a) * 2 > total:
		print('T')
	else:
		print('HL')


import sys
import math
input = sys.stdin.readline
from collections import deque
from queue import LifoQueue
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print('T')
	else:
		pp = sum(a)
		if max(a) > pp / 2:
			print('T')
		elif pp % 2 == 0:
			print('HL')
		else:
			print('T')


t = int(input())
for o in range(t):
	n = int(input())
	a = list(map(int, input().strip().split()))
	tot = 0
	mx = 0
	for i in a:
		if i > 0:
			tot += i
			mx = max(mx, i)
	if n == 1:
		print('T')
	elif tot % 2 or mx > tot // 2:
		print('T')
	else:
		print('HL')


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	s = sum(a)
	ans = -1
	for i in range(n):
		if a[i] > s // 2:
			ans = 0
			break
	if ans == -1:
		if s & 1:
			ans = 0
		else:
			ans = 1
	if ans:
		print('HL')
	else:
		print('T')


import sys, math, cmath, time
start_time = time.time()

def solve():
	n = inp()
	a = sorted(inlt())
	if sum(a) - a[-1] >= a[-1]:
		q = sum(a) % 2
	else:
		q = 1
	print(['HL', 'T'][q])

def main():
	global tt
	if not ONLINE_JUDGE:
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	t = 1
	t = inp()
	for tt in range(t):
		solve()
	if not ONLINE_JUDGE:
		print('Time Elapsed :', time.time() - start_time, 'seconds')
		sys.stdout.close()

def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	return input().strip()

def invr():
	return map(int, input().split())

def counter(a):
	q = [0] * max(a)
	for i in range(len(a)):
		q[a[i] - 1] = q[a[i] - 1] + 1
	return q

def counter_elements(a):
	q = dict()
	for i in range(len(a)):
		if a[i] not in q:
			q[a[i]] = 0
		q[a[i]] = q[a[i]] + 1
	return q

def string_counter(a):
	q = [0] * 26
	for i in range(len(a)):
		q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
	return q

def factors(n):
	q = []
	for i in range(1, int(n ** 0.5) + 1):
		if n % i == 0:
			q.append(i)
			q.append(n // i)
	return list(sorted(list(set(q))))

def prime_factors(n):
	q = []
	while n % 2 == 0:
		q.append(2)
		n = n // 2
	for i in range(3, int(n ** 0.5) + 1, 2):
		while n % i == 0:
			q.append(i)
			n = n // i
	if n > 2:
		q.append(n)
	return list(sorted(q))

def transpose(a):
	(n, m) = (len(a), len(a[0]))
	b = [[0] * n for i in range(m)]
	for i in range(m):
		for j in range(n):
			b[i][j] = a[j][i]
	return b

def factorial(n, m=1000000007):
	q = 1
	for i in range(n):
		q = q * (i + 1) % m
	return q
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
	input = sys.stdin.readline
main()


import sys
import math

def II():
	return int(sys.stdin.readline())

def LI():
	return list(map(int, sys.stdin.readline().split()))

def MI():
	return map(int, sys.stdin.readline().split())

def SI():
	return sys.stdin.readline().strip()
t = II()
for q in range(t):
	n = II()
	a = LI()
	if n == 1:
		print('T')
	elif max(a) > sum(a) / 2:
		print('T')
	elif sum(a) % 2 == 0:
		print('HL')
	else:
		print('T')


for _ in range(int(input())):
	n = int(input())
	a = [*map(int, input().split())]
	(s, mx) = (sum(a), max(a))
	print('T' if s % 2 == 1 or mx > s - mx else 'HL')


t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	summ = sum(arr)
	maxi = max(arr)
	summ = summ - maxi
	if summ >= maxi and summ % 2 == maxi % 2:
		print('HL')
	else:
		print('T')


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	maxnum = max(a)
	tot = sum(a)
	if maxnum * 2 > tot or tot & 1:
		print('T')
	else:
		print('HL')


import sys

def i():
	return sys.stdin.readline()[:-1]

def solve(held, piles, stoneCount):
	winning = True
	while True:
		if piles[-1] > stoneCount // 2:
			break
		winning = not winning
		nextHeld = piles.pop() - 1
		if held != 0:
			piles.append(held)
		held = nextHeld
		stoneCount -= 1
		piles.sort()
	return winning
cases = int(i())
for x in range(cases):
	pileCount = int(i())
	piles = sorted(list(map(int, i().split())))
	totalStones = sum(piles)
	if solve(0, piles, totalStones):
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	N = int(input())
	array = sorted([int(x) for x in input().split()])
	total = sum(array)
	if N == 1 or array[-1] > total - array[-1]:
		print('T')
	elif total % 2 == 0:
		print('HL')
	else:
		print('T')


for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print('T')
	else:
		a = sorted(a)
		a = a[::-1]
		t = sum(a)
		d = 0
		c = 0
		m = max(a)
		while t > m:
			if a[0] > 0:
				a[0] -= 1
				t -= 1
			else:
				c = 1
			if a[1] > 0:
				a[1] -= 1
				t -= 1
			else:
				d = 1
			a = sorted(a)
			a = a[::-1]
			m = a[0]
		if m == 0:
			print('HL')
		else:
			print('T')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	t = 0
	hl = 0
	if max(a) > sum(a) - max(a) or sum(a) % 2:
		print('T')
	else:
		print('HL')


import sys
import math
from collections import defaultdict, Counter
input = sys.stdin.readline

def print(x):
	sys.stdout.write(str(x) + '\n')
t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	s = sum(a)
	ma = max(a)
	if n == 1 or ma > s - ma:
		print('T')
		continue
	if s % 2 == 0:
		print('HL')
	else:
		print('T')


for w in range(int(input())):
	n = int(input())
	l = [int(i) for i in input().split()]
	s = sum(l)
	if max(l) * 2 > s:
		print('T')
	else:
		print('HL') if s % 2 == 0 else print('T')


for t in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	l.sort()
	s = sum(l)
	if l[-1] > s - l[-1]:
		print('T')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


from math import ceil
from collections import deque, defaultdict
from heapq import heapify, heappop, heappush
INF = float('inf')
it = lambda : list(map(int, input().strip().split()))

def solve():
	input()
	A = it()
	S = sum(A)
	M = max(A)
	if M > S - M or S % 2 == 1:
		print('T')
	else:
		print('HL')
T = int(input())
for _ in range(T):
	solve()


TC = int(input())
for tc in range(TC):
	N = int(input())
	A = list(map(int, input().split()))
	max_a = max(A)
	sum_a = sum(A)
	if max_a > sum_a - max_a:
		print('T')
	elif sum_a % 2 != 0:
		print('T')
	else:
		print('HL')


t = int(input())
for q in range(t):
	n = int(input())
	A = [int(i) for i in input().split()]
	vis = -1
	last = 1
	t = True
	while t:
		m = 0
		mi = -1
		sm = 0
		smi = -1
		for i in range(n):
			if A[i] > m:
				sm = m
				smi = mi
				m = A[i]
				mi = i
			elif A[i] > sm:
				sm = A[i]
				smi = i
		if m == 0 and sm == 0:
			break
		if vis != mi:
			A[mi] -= 1
			vis = mi
			last = (last + 1) % 2
		elif sm == 0:
			break
		else:
			A[smi] -= 1
			vis = smi
			last = (last + 1) % 2
	if last == 1:
		print('HL')
	else:
		print('T')


import math

def main():
	n = int(input())
	lst = list(map(int, input().split()))
	if n == 1:
		print('T')
	elif n == 2:
		if lst[0] == lst[1]:
			print('HL')
		else:
			print('T')
	else:
		sm = 0
		mx = 0
		for i in lst:
			sm += i
			mx = max(i, mx)
		if mx > sm - mx:
			print('T')
		elif sm % 2 == 0:
			print('HL')
		else:
			print('T')
t = int(input())
for i in range(t):
	main()


t = int(input())
while t:
	t -= 1
	n = int(input())
	lst = list(map(int, input().split()))
	max_ele = max(lst)
	sum1 = sum(lst)
	diff = sum1 - max_ele
	if max_ele > sum1:
		print('T')
	elif diff >= max_ele and diff % 2 == max_ele % 2:
		print('HL')
	else:
		print('T')


from sys import stdin
input = lambda : stdin.readline().strip()
from math import ceil, sqrt, factorial, gcd
from collections import deque
from heapq import *
for _ in range(int(input())):
	n = int(input())
	l = list(map(lambda a: -1 * int(a), input().split()))
	heapify(l)
	count = 0
	prev = 0
	while l:
		x = heappop(l)
		if prev < -1:
			heappush(l, prev + 1)
		prev = x
		count += 1
	if count % 2 != 0:
		print('T')
	else:
		print('HL')


from sys import stdin
input = stdin.readline
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	s = sum(a)
	flag = False
	for i in range(n):
		if a[i] > s // 2:
			flag = True
	if flag:
		print('T')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


t = int(input())
for _ in range(t):
	p = int(input())
	arr = list(map(int, input().split()))
	if len(arr) == 1:
		print('T')
	else:
		last = 999
		ind = 997
		c = 0
		while ind != 998:
			ind = 998
			best = 0
			for i in range(len(arr)):
				if arr[i] > best and i != last:
					ind = i
					best = arr[i]
			if ind < 900:
				arr[ind] -= 1
				c += 1
			last = ind
		if c % 2 == 0:
			print('HL')
		else:
			print('T')


from os import path
import sys
from heapq import heappush, heappop
from functools import cmp_to_key as ctk
from collections import deque, defaultdict as dd
from bisect import bisect, bisect_left, bisect_right, insort, insort_left, insort_right
from itertools import permutations
from datetime import datetime
from math import ceil, sqrt, log, gcd

def ii():
	return int(input())

def si():
	return input().rstrip()

def mi():
	return map(int, input().split())

def li():
	return list(mi())
abc = 'abcdefghijklmnopqrstuvwxyz'
mod = 1000000007
inf = float('inf')
vow = ['a', 'e', 'i', 'o', 'u']
(dx, dy) = ([-1, 1, 0, 0], [0, 0, 1, -1])

def bo(i):
	return ord(i) - ord('a')
file = 1

def solve():
	for _ in range(ii()):
		n = ii()
		a = li()
		s = sum(a)
		mx = max(a)
		x = s - mx
		if s % 2:
			print('T')
		elif mx > x:
			print('T')
		else:
			print('HL')
if file:
	if path.exists('input.txt'):
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	else:
		input = sys.stdin.readline
solve()


def solve(testCase, pile, stone):
	stone.sort(reverse=True)
	player1 = 0
	player2 = 0
	sum = 0
	for i in stone:
		sum += int(i)
	if 2 * int(stone[0]) > sum:
		return 'T'
	elif sum % 2 == 0:
		return 'HL'
	else:
		return 'T'
testCase = int(input())
while testCase:
	testCase -= 1
	pile = int(input())
	stone = [int(x) for x in input().split()]
	print(solve(testCase, pile, stone))


t = int(input())
for test in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort()
	s = sum(a)
	val = s - 2 * a[-1]
	if a[-1] > s - a[-1] or val % 2 == 1:
		print('T')
	else:
		print('HL')


def solve(n, piles):
	mx = max(piles)
	sm = sum(piles)
	if mx > sm - mx:
		return 'T'
	if sm % 2 == 1:
		return 'T'
	return 'HL'
t = int(input())
for t in range(t):
	n = int(input())
	piles = [int(s) for s in input().split()]
	result = solve(n, piles)
	print(result)


l = []
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	m = max(a)
	sum = 0
	for i in range(n):
		sum = sum + a[i]
	if sum < 2 * m or sum % 2 == 1:
		l.append('T')
	else:
		l.append('HL')
for i in l:
	print(i)


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	s = sum(l)
	end = False
	for i in l:
		if i > s - i:
			end = True
			break
	if end:
		print('T')
	else:
		print('T' if s % 2 == 1 else 'HL')


import heapq
t = int(input())
for _ in range(t):
	n = int(input())
	a = [-int(x) for x in input().split()]
	if n == 1:
		print('T')
	else:
		heapq.heapify(a)
		cnt = 0
		while True:
			cnt += 1
			if cnt > 1:
				last = temp
			temp = heapq.heappop(a)
			if cnt > 1:
				heapq.heappush(a, last)
			if temp == 0:
				break
			temp += 1
		if cnt % 2:
			print('HL')
		else:
			print('T')


import math
T = int(input())
for _ in range(T):
	n = int(input())
	a = [int(x) for x in input().split()]
	su = sum(a)
	ma = max(a)
	if math.floor(su / 2) < ma:
		print('T')
	elif su % 2 == 1:
		print('T')
	else:
		print('HL')


from bisect import bisect_left, bisect_right
from sys import stdin, stdout
R = lambda : stdin.readline().strip()
RL = lambda f=None: list(map(f, R().split(' '))) if f else list(R().split(' '))
output = lambda x: stdout.write(str(x) + '\n')
output_list = lambda x: output(' '.join(map(str, x)))
for tc in range(int(R())):
	n = int(R())
	a = RL(int)
	if not n:
		output('HL')
		continue
	sm = sum(a)
	s = sm // 2
	flag = True
	for i in a:
		if i > s:
			output('T')
			flag = False
			break
	if flag:
		if sm % 2:
			output('T')
		else:
			output('HL')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	most = max(a)
	s = sum(a)
	if most > s - most:
		print('T')
	elif most == s - most:
		print('HL')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


def check_done(a):
	count = 0
	for i in a:
		if i != 0:
			count += 1
			if count == 2:
				return False
	return True
t = int(input())
for i in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	s = sum(a)
	turn = 'T'
	T_pick = -1
	H_pick = -1
	while True:
		if n == 1:
			print('T')
			break
		max_num = max(a)
		idx_max = a.index(max_num)
		max_two = -1
		max_two_idx = -1
		for i in range(n):
			if i != idx_max:
				if a[i] > max_two:
					max_two = a[i]
					max_two_idx = i
		if turn == 'T':
			turn = 'HL'
			if H_pick != idx_max:
				T_pick = idx_max
				a[idx_max] -= 1
			else:
				T_pick = max_two_idx
				a[max_two_idx] -= 1
		else:
			turn = 'T'
			if T_pick != idx_max:
				H_pick = idx_max
				a[idx_max] -= 1
			else:
				H_pick = max_two_idx
				a[max_two_idx] -= 1
		if check_done(a):
			print(turn)
			break


import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log
from collections import defaultdict as dd
from bisect import bisect_left as bl, bisect_right as br
import heapq
sys.setrecursionlimit(100000000)
ii = lambda : int(input())
si = lambda : input()
jn = lambda x, l: x.join(map(str, l))
sl = lambda : list(map(str, input().strip()))
mi = lambda : map(int, input().split())
mif = lambda : map(float, input().split())
lii = lambda : list(map(int, input().split()))
ceil = lambda x: int(x) if x == int(x) else int(x) + 1
ceildiv = lambda x, d: x // d if x % d == 0 else x // d + 1
flush = lambda : stdout.flush()
stdstr = lambda : stdin.readline()
stdint = lambda : int(stdin.readline())
stdpr = lambda x: stdout.write(str(x))
mod = 1000000007
for _ in range(ii()):
	n = ii()
	arr = lii()
	for i in range(n):
		arr[i] = -arr[i]
	heapq.heapify(arr)
	while len(arr) > 0:
		x = heapq.heappop(arr)
		x += 1
		flag = 0
		if len(arr) > 0:
			y = heapq.heappop(arr)
			y += 1
			flag = 1
		if flag == 0:
			break
		if x < 0:
			heapq.heappush(arr, x)
		if y < 0:
			heapq.heappush(arr, y)
	if flag == 0:
		print('T')
	else:
		print('HL')


import sys, os, io

def rs():
	return sys.stdin.readline().rstrip()

def ri():
	return int(sys.stdin.readline())

def ria():
	return list(map(int, sys.stdin.readline().split()))

def ws(s):
	sys.stdout.write(s + '\n')

def wi(n):
	sys.stdout.write(str(n) + '\n')

def wia(a):
	sys.stdout.write(' '.join([str(x) for x in a]) + '\n')
import math, datetime, functools, itertools, operator, bisect, fractions
from collections import deque, defaultdict, OrderedDict, Counter
from fractions import Fraction
from decimal import Decimal

def main():
	starttime = datetime.datetime.now()
	if os.path.exists('input.txt'):
		sys.stdin = open('input.txt', 'r')
		sys.stdout = open('output.txt', 'w')
	for _ in range(ri()):
		n = ri()
		a = ria()
		chance = 0
		indexprev = -1
		while True:
			maxn = 0
			c = 0
			for i in range(n):
				if a[i] > maxn and i != indexprev:
					maxn = a[i]
					indexcurr = i
					c += 1
			if c:
				a[indexcurr] -= 1
				chance = 1 - chance
				indexprev = indexcurr
			else:
				break
		if chance:
			print('T')
		else:
			print('HL')
	endtime = datetime.datetime.now()
	time = (endtime - starttime).total_seconds() * 1000
	if os.path.exists('input.txt'):
		print('Time:', time, 'ms')

class FastReader(io.IOBase):
	newlines = 0

	def __init__(self, fd, chunk_size=1024 * 8):
		self._fd = fd
		self._chunk_size = chunk_size
		self.buffer = io.BytesIO()

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self, size=-1):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, self._chunk_size if size == -1 else size))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

class FastWriter(io.IOBase):

	def __init__(self, fd):
		self._fd = fd
		self.buffer = io.BytesIO()
		self.write = self.buffer.write

	def flush(self):
		os.write(self._fd, self.buffer.getvalue())
		(self.buffer.truncate(0), self.buffer.seek(0))

class FastStdin(io.IOBase):

	def __init__(self, fd=0):
		self.buffer = FastReader(fd)
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

class FastStdout(io.IOBase):

	def __init__(self, fd=1):
		self.buffer = FastWriter(fd)
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.flush = self.buffer.flush
sys.stdin = FastStdin()
sys.stdout = FastStdout()
main()


t = int(input())
for _ in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	s = sum(arr)
	if n == 1 and s > 0 or sum(arr) < 2 * max(arr):
		print('T')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


t = int(input())
array = []
while t > 0:
	t -= 1
	n = int(input())
	temp = 0
	max_val = 0
	array.clear()
	temp_input = input().split(' ')
	for i in range(len(temp_input)):
		array.append(int(temp_input[i]))
		max_val = max(max_val, array[i])
		temp += array[i]
	if n == 1:
		print('T')
	elif n == 2:
		if array[0] == array[1]:
			print('HL')
		else:
			print('T')
	elif max_val > temp - max_val:
		print('T')
	elif temp % 2 == 1:
		print('T')
	else:
		print('HL')


t = int(input())
for t_ in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	if len(a) == 1:
		print('T')
	if len(a) == 2:
		if a[0] == a[1]:
			print('HL')
		else:
			print('T')
	if len(a) >= 3:
		if max(a) > sum(a) - max(a):
			print('T')
		elif sum(a) % 2 == 1:
			print('T')
		else:
			print('HL')


t = int(input().split()[0])
for case in range(t):
	n = int(input().split()[0])
	a = list(map(int, input().split()))
	if n == 1:
		print('T')
	else:
		a.sort()
		if sum(a) - a[n - 1] < a[n - 1]:
			print('T')
		elif sum(a) % 2 == 0:
			print('HL')
		else:
			print('T')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split(' ')))
	v = sorted(arr)[::-1]
	if v[0] > sum(v) - v[0] or sum(v) % 2 == 1:
		print('T')
	else:
		print('HL')


import sys, io, os
BUFSIZE = 8192

class FastIO(io.IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = io.BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(io.IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
T = int(input())
for _ in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	if N == 1:
		print('T')
		continue
	if N == 2:
		if A[0] == A[1]:
			print('HL')
		else:
			print('T')
		continue
	sumA = sum(A)
	maxA = max(A)
	if maxA * 2 > sumA:
		print('T')
		continue
	if sumA % 2:
		print('T')
	else:
		print('HL')


import sys
input = sys.stdin.buffer.readline
T = int(input())
for testcase in range(T):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort()
	if n == 1:
		print('T')
	else:
		s = sum(a) - a[-1]
		if a[-1] > s:
			print('T')
		else:
			s += a[-1]
			if s % 2 == 0:
				print('HL')
			else:
				print('T')


T = int(input())
for _ in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	A = sorted(A)
	A_sum = sum(A)
	if A[-1] > A_sum - A[-1]:
		print('T')
	elif A_sum % 2 == 0:
		print('HL')
	else:
		print('T')


from sys import stdin, stdout, setrecursionlimit
from math import gcd, ceil, sqrt
from collections import Counter, deque
from bisect import bisect_left, bisect_right
import heapq
ii1 = lambda : int(stdin.readline().strip())
is1 = lambda : stdin.readline().strip()
iia = lambda : list(map(int, stdin.readline().strip().split()))
isa = lambda : stdin.readline().strip().split()
setrecursionlimit(100000)
mod = 1000000007
tc = ii1()
for _ in range(tc):
	n = ii1()
	arr = [-1 * i for i in iia()]
	heapq.heapify(arr)
	prev = None
	flag = 0
	while len(arr):
		cur = heapq.heappop(arr)
		if prev == None:
			prev = abs(cur) - 1
		else:
			if prev > 0:
				heapq.heappush(arr, -1 * prev)
			prev = abs(cur) - 1
		flag = flag ^ 1
	if flag:
		print('T')
	else:
		print('HL')


t = int(input())
arr = []
while t > 0:
	t -= 1
	n = int(input())
	a = 0
	maxi = 0
	arr.clear()
	inpArr = input().split(' ')
	for i in range(len(inpArr)):
		arr.append(int(inpArr[i]))
		maxi = max(maxi, arr[i])
		a += arr[i]
	if n == 1:
		print('T')
	elif n == 2:
		if arr[0] == arr[1]:
			print('HL')
		else:
			print('T')
	elif maxi > a - maxi:
		print('T')
	elif a % 2 == 1:
		print('T')
	else:
		print('HL')


from sys import stdin, stdout

def stoned_game(n, a_a):
	s = sum(a_a)
	for a in a_a:
		if a > s // 2:
			return 'T'
	if s % 2 == 0:
		return 'HL'
	else:
		return 'T'
t = int(stdin.readline())
for _ in range(t):
	n = int(stdin.readline())
	a_a = list(map(int, stdin.readline().split()))
	stdout.write(stoned_game(n, a_a) + '\n')


def stoned(arr):
	s = sum(arr)
	if max(arr) > s // 2:
		return 'T'
	if s % 2 == 0:
		return 'HL'
	else:
		return 'T'
for i in range(int(input())):
	a = input()
	lst = list(map(int, input().strip().split()))
	print(stoned(lst))


import sys

def main():
	tn = int(input())
	for ti in range(tn):
		n = int(input())
		A = [int(a) for a in input().split()]
		ma = max(A)
		sa = sum(A)
		if ma > sa - ma or sa % 2 == 1:
			print('T')
		else:
			print('HL')
main()


for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	visit = [[0, 0] for i in range(101)]
	for i in range(n):
		visit[a[i]][0] += 1
	count = 0
	(i, flag) = (0, 0)
	visit[0][0] = 1
	while True:
		(i, flag) = (100, 0)
		while i >= 0:
			if visit[i][0] > 0 and visit[i][1] == 0 and (flag == 0):
				if i == 0:
					flag = 2
					break
				visit[i - 1][0] += 1
				visit[i][0] -= 1
				if visit[i - 1][0] == 1:
					visit[i - 1][1] = 1
				else:
					visit[i - 1][1] = 0
				flag = 1
				count += 1
				i -= 1
			else:
				visit[i][1] = 0
			i -= 1
		if flag == 2:
			break
	if count % 2 == 0:
		print('HL')
	else:
		print('T')


T = 1
T = int(input())
while T:
	T -= 1
	n = int(input())
	a = list(map(int, input(' ').split()))
	Max = a[0]
	Sum = 0
	for i in a:
		Sum += i
		Max = max(Max, i)
	if Max > Sum - Max or Sum % 2 == 1:
		print('T')
	else:
		print('HL')


t = int(input())
for _ in range(t):
	n = int(input())
	a = sorted([int(x) for x in input().split()])
	s1 = sum(a[0:n - 1])
	s2 = a[n - 1]
	if s2 > s1:
		print('T')
	elif sum(a) % 2:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	mx = max(a)
	sm = sum(a)
	if mx << 1 > sm:
		print('T')
	else:
		print('T' if sm & 1 else 'HL')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	s = sum(arr)
	if s % 2 != 0:
		print('T')
	else:
		falg = 0
		for i in range(n):
			if arr[i] > s // 2:
				print('T')
				falg = 1
		if falg == 0:
			print('HL')


for _ in range(int(input())):
	n = int(input())
	A = list(map(int, input().split()))
	A.sort(reverse=True)
	sum = 0
	for i in A:
		sum += i
	if A[0] > sum - A[0] or sum % 2 != 0:
		print('T')
	else:
		print('HL')


import sys, io, os, time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect, math, heapq
alphabet = 'abcdefghijklmnopqrstuvwxyz'
input = sys.stdin.readline
for ii in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	s = sum(arr)
	arr.sort()
	if arr[n - 1] + arr[n - 1] > s:
		print('T')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


import os
import sys
from io import BytesIO, IOBase
from collections import Counter
import math as mt
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)

def lcm(a, b):
	return a * b / gcd(a, b)
mod = int(1000000000.0) + 7

def power(k, n):
	if n == 0:
		return 1
	if n % 2:
		return power(k, n - 1) * k % mod
	t = power(k, n // 2)
	return t * t % mod

def totalPrimeFactors(n):
	count = 0
	if n % 2 == 0:
		count += 1
		while n % 2 == 0:
			n //= 2
	i = 3
	while i * i <= n:
		if n % i == 0:
			count += 1
			while n % i == 0:
				n //= i
		i += 2
	if n > 2:
		count += 1
	return count

def main():
	for _ in range(int(input())):
		n = int(input())
		a = list(map(int, input().split()))
		prev = -1
		now = 0
		while 1:
			maxx = 0
			ind = -1
			for i in range(n):
				if i != prev and a[i] > maxx:
					maxx = a[i]
					ind = i
			if maxx == 0:
				if now == 0:
					print('HL')
				else:
					print('T')
				break
			now ^= 1
			a[ind] -= 1
			prev = ind
	return
main()


a = int(input())
b = []
c = []
for i in range(a):
	b.append(int(input()))
	c.append(list(map(int, input().split())))
for i in range(a):
	if b[i] == 1:
		print('T')
	elif b[i] == 2:
		if c[i][0] == c[i][1]:
			print('HL')
		else:
			print('T')
	elif max(c[i]) > sum(c[i]) / 2:
		print('T')
	elif sum(c[i]) % 2 == 0:
		print('HL')
	else:
		print('T')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	sum_ = sum(arr)
	max_ = max(arr)
	if sum_ - max_ < max_ or sum_ % 2 == 1:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	n = int(input())
	a = sorted(list(map(int, input().split())))
	print('T' if sum(a[:-1]) < a[-1] else 'HTL'[sum(a) % 2::2])


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort()
	sumi = sum(a[:n - 1])
	s = a[-1]
	if s > sumi:
		print('T')
		continue
	sumi += s
	if sumi % 2:
		print('T')
		continue
	print('HL')


for _ in range(int(input())):
	n = int(input())
	piles = list(map(int, input().split()))
	if n == 1:
		print('T')
	else:
		maxx = max(piles)
		summ = sum(piles)
		if maxx > summ - maxx:
			print('T')
		elif summ % 2 == 0:
			print('HL')
		else:
			print('T')


for i in range(int(input())):
	n = int(input())
	a = sorted(list(map(int, input().split())))
	add = sum(a[:-1])
	if a[-1] > add:
		print('T')
	else:
		print(['HL', 'T'][(add + a[-1]) % 2])


T = int(input())
for t in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	pick = -1
	mx = 0
	curr = 'HL'
	while 1 == 1:
		mx = 0
		new_pick = -1
		for i in range(N):
			if i != pick and A[i] > mx:
				mx = A[i]
				new_pick = i
		if new_pick == -1:
			break
		if curr == 'T':
			curr = 'HL'
		else:
			curr = 'T'
		A[new_pick] -= 1
		pick = new_pick
	print(curr)


import sys
T = int(sys.stdin.readline().strip())
for t in range(0, T):
	n = int(sys.stdin.readline().strip())
	a = list(map(int, sys.stdin.readline().strip().split()))
	if max(a) > sum(a) / 2:
		print('T')
	elif sum(a) % 2 == 1:
		print('T')
	else:
		print('HL')


import sys
import math
import heapq
import collections

def inputnum():
	return int(input())

def inputnums():
	return map(int, input().split())

def inputlist():
	return list(map(int, input().split()))

def inputstring():
	return [x for x in input()]

def inputstringnum():
	return [ord(x) - ord('a') for x in input()]

def inputmatrixchar(rows):
	arr2d = [[j for j in input().strip()] for i in range(rows)]
	return arr2d

def inputmatrixint(rows):
	arr2d = []
	for _ in range(rows):
		arr2d.append([int(i) for i in input().split()])
	return arr2d
t = int(input())
for q in range(t):
	n = inputnum()
	a = inputlist()
	moves = 0
	cur = -1
	while 1:
		mx = 0
		for i in range(n):
			if i != cur:
				mx = max(mx, a[i])
		if mx == 0:
			break
		for i in range(n):
			if a[i] == mx:
				a[i] -= 1
				cur = i
				break
		moves += 1
	if moves % 2 == 1:
		print('T')
	else:
		print('HL')


def f(list):
	sum = 0
	max = -1
	ii = len(list)
	if ii == 1:
		return 1
	for i in range(ii):
		buff = int(list[i])
		sum += buff
		if buff > max:
			max = buff
	sum -= max
	if max > sum:
		return 1
	elif max == sum:
		return 0
	else:
		return (sum + max) % 2
n = int(input())
while n:
	n -= 1
	ip1 = int(input())
	ip2 = input().split()
	if f(ip2) == 0:
		print('HL')
	else:
		print('T')


import sys
t = int(sys.stdin.readline().strip())
for _ in range(t):
	n = int(sys.stdin.readline().strip())
	nums = list(map(int, sys.stdin.readline().strip().split()))
	prev = -1
	t_win = False
	while True:
		best = 0
		best_ind = None
		for i in range(n):
			if i == prev:
				continue
			if nums[i] > best:
				best = nums[i]
				best_ind = i
		if best_ind == None:
			print('T' if t_win else 'HL')
			break
		nums[best_ind] -= 1
		t_win = not t_win
		prev = best_ind


for _ in range(int(input())):
	n = int(input())
	a = [int(i) for i in input().split()]
	case = 2
	s = sum(a)
	half = s // 2
	for k in a:
		if k > half:
			case = 1
	if case == 2:
		if s % 2:
			print('T')
		else:
			print('HL')
	else:
		print('T')


for _ in range(int(input())):
	n = int(input())
	a = [*map(int, input().split())]
	p = max(a)
	s = sum(a) - p
	if (s + p) % 2 == 1:
		print('T')
	elif p > s:
		print('T')
	else:
		print('HL')


def game():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print('T')
	elif n == 2:
		if a[0] == a[1]:
			print('HL')
		else:
			print('T')
	elif sum(a) % 2 or max(a) * 2 > sum(a):
		print('T')
	else:
		print('HL')
for _ in range(int(input())):
	game()


import sys, math, heapq, copy
from collections import defaultdict, deque
from bisect import bisect_left, bisect_right
from functools import cmp_to_key
t = int(input())
for _ in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	for i in range(n):
		l[i] = -l[i]
	heapq.heapify(l)
	first = second = flag = 0
	while l:
		temp = heapq.heappop(l)
		if flag == 0:
			flag = 1
			if abs(second) > 1:
				heapq.heappush(l, second + 1)
			first = temp
		else:
			flag = 0
			if abs(first) > 1:
				heapq.heappush(l, first + 1)
			second = temp
	if flag == 0:
		print('HL')
	else:
		print('T')


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	s = sum(a)
	flag = False
	for x in a:
		if x > s // 2:
			flag = True
			break
	if flag:
		print('T')
		continue
	print('HL' if s % 2 == 0 else 'T')


for _ in range(int(input())):
	n = int(input())
	l = [*map(int, input().split())]
	flag = True
	prev = -1
	while True:
		breakOrNot = True
		if prev == -1:
			prev = l.index(max(l))
			l[prev] -= 1
			flag = not flag
			breakOrNot = False
		elif flag:
			ind = l.index(max(l))
			if ind != prev and l[ind] > 0:
				prev = ind
				l[ind] -= 1
				flag = not flag
				breakOrNot = False
			else:
				temp = 0
				ind = 0
				for i in range(n):
					if l[i] > temp and i != prev:
						temp = l[i]
						ind = i
				if temp != 0 and l[ind] > 0:
					prev = ind
					l[prev] -= 1
					flag = not flag
					breakOrNot = False
		else:
			ind = l.index(max(l))
			if ind != prev and l[ind] > 0:
				prev = ind
				l[ind] -= 1
				flag = not flag
				breakOrNot = False
			else:
				temp = 0
				ind = 0
				for i in range(n):
					if l[i] > temp and i != prev:
						temp = l[i]
						ind = i
				if temp != 0 and l[ind] > 0:
					prev = ind
					l[prev] -= 1
					flag = not flag
					breakOrNot = False
		if breakOrNot:
			break
	if not flag:
		print('T')
	else:
		print('HL')


t = int(input())
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()))
	l.sort(reverse=True)
	if n == 1:
		print('T')
	elif l[0] > sum(l[1:]):
		print('T')
	elif sum(l) % 2 == 1:
		print('T')
	else:
		print('HL')


t = int(input())
for q in range(t):
	n = int(input())
	mas = list(map(int, input().split()))
	if max(mas) > sum(mas) - max(mas):
		print('T')
	elif sum(mas) % 2 == 0:
		print('HL')
	else:
		print('T')


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	a = sorted(a)
	if sum(a[:-1]) < a[-1]:
		print('T')
	else:
		xr = 0
		for i in a:
			xr ^= i
		if xr % 2 == 0:
			print('HL')
		else:
			print('T')


import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import defaultdict
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	s = sum(a)
	if a[0] > s - a[0] or s % 2 == 1:
		print('T')
	else:
		print('HL')


import io
import os

def solve(N, A):
	if N == 1:
		assert A[0] > 0
		return 'T'
	if N == 2:
		if A[0] == A[1]:
			return 'HL'
		else:
			return 'T'
	assert N >= 3
	total = sum(A)
	if total % 2 == 1:
		return 'T'
	mx = max(A)
	if mx > total - mx:
		return 'T'
	return 'HL'

def solveBrute(N, A):
	players = ['T', 'HL']

	def simulate(A, last):
		canWin = False
		for i in range(N):
			if i != last and A[i]:
				A[i] -= 1
				who = simulate(A, i)
				if who == 1:
					canWin = True
				A[i] += 1
				if canWin:
					break
		if canWin:
			return 0
		return 1
	who = simulate(A, None)
	return players[who]
DEBUG = False
if DEBUG:
	import random
	random.seed(0)
	for _ in range(1000):
		N = random.randint(1, 4)
		A = [random.randint(1, 6) for i in range(N)]
		print('tc', _, N, A)
		ans1 = solve(N, A)
		print(ans1)
		ans2 = solveBrute(N, A)
		print(ans2)
		assert ans1 == ans2
		print()
	exit()
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
TC = int(input())
for tc in range(1, TC + 1):
	(N,) = [int(x) for x in input().split()]
	A = [int(x) for x in input().split()]
	ans = solve(N, A)
	print(ans)


import heapq
import sys

def method1(n, piles):
	if n == 1:
		print('T')
	elif sum(piles) % 2 == 0:
		print('HL')
	else:
		print('T')

def method2(n, piles):
	piles = [-x for x in piles]
	turn = False
	heapq.heapify(piles)
	last = 0
	while piles:
		curr = heapq.heappop(piles)
		if last:
			heapq.heappush(piles, last)
		last = curr + 1
		turn = not turn
	if turn:
		print('T')
	else:
		print('HL')

def main():
	t = int(input())
	for _ in range(t):
		n = int(input())
		piles = [int(x) for x in input().split()]
		assert n == len(piles)
		method2(n, piles)
main()


t = int(input())
for i in range(t):
	n = input()
	arr = [int(x) for x in input().split()]
	ma = max(arr)
	k = sum(arr) - max(arr)
	if ma > k:
		print('T')
	else:
		print('T' if (ma + k) % 2 == 1 else 'HL')


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	maxPile = max(a)
	numStones = sum(a)
	if maxPile * 2 > numStones or numStones & 1:
		print('T')
	else:
		print('HL')


import sys
import math
input = sys.stdin.readline
T = int(input())
for t in range(T):
	N = int(input())
	A = list(map(int, input().split(' ')))
	S = sum(A)
	solved = False
	for a in A:
		if 2 * a > S:
			print('T')
			solved = True
			break
	if solved:
		continue
	print('T' if S % 2 == 1 else 'HL')


t = int(input())
for _ in range(t):
	n = int(input())
	suma = 0
	winner = 0
	a = list(map(int, input().split()))
	suma = sum(a)
	for i in range(n):
		winner = max(a[i], winner)
	if winner > suma / 2 or suma % 2:
		print('T')
	else:
		print('HL')


import os
from io import BytesIO, IOBase
from collections import Counter
import sys

def main():
	for t in range(int(input())):
		n = int(input())
		a = list(map(int, input().split()))
		ma = max(a)
		s = sum(a)
		if s - ma < ma:
			print('T')
		elif s - ma == ma:
			print('HL')
		elif (s - ma - ma) % 2 == 1:
			print('T')
		else:
			print('HL')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
main()


def func(li, s):
	for i in li:
		if i > s // 2:
			return print('T')
	if s % 2 == 0:
		return print('HL')
	else:
		return print('T')
for _ in range(int(input())):
	n = int(input())
	ai = list(map(int, input().split()))
	summ = sum(ai)
	func(ai, summ)


import sys
input = sys.stdin.readline

def ceil(x):
	if x != int(x):
		x = int(x) + 1
	return x

def factorial(x, m):
	val = 1
	while x > 0:
		val = val * x % m
		x -= 1
	return val

def fact(x):
	val = 1
	while x > 0:
		val *= x
		x -= 1
	return val

def swaparr(arr, a, b):
	temp = arr[a]
	arr[a] = arr[b]
	arr[b] = temp

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def lcm(a, b):
	return a * b // gcd(a, b)

def nCr(n, k):
	if k > n:
		return 0
	if k > n - k:
		k = n - k
	res = 1
	for i in range(k):
		res = res * (n - i)
		res = res / (i + 1)
	return int(res)

def upper_bound(a, x, lo=0, hi=None):
	if hi == None:
		hi = len(a)
	while lo < hi:
		mid = (lo + hi) // 2
		if a[mid] < x:
			lo = mid + 1
		else:
			hi = mid
	return lo

def primefs(n):
	primes = {}
	while n % 2 == 0 and n > 0:
		primes[2] = primes.get(2, 0) + 1
		n = n // 2
	for i in range(3, int(n ** 0.5) + 2, 2):
		while n % i == 0 and n > 0:
			primes[i] = primes.get(i, 0) + 1
			n = n // i
	if n > 2:
		primes[n] = primes.get(n, 0) + 1
	return primes

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def swap(a, b):
	temp = a
	a = b
	b = temp
	return (a, b)

def find(x, link):
	p = x
	while p != link[p]:
		p = link[p]
	while x != p:
		nex = link[x]
		link[x] = p
		x = nex
	return p

def union(x, y, link, size):
	x = find(x, link)
	y = find(y, link)
	if size[x] < size[y]:
		(x, y) = swap(x, y)
	if x != y:
		size[x] += size[y]
		link[y] = x

def sieve(n):
	prime = [True for i in range(n + 1)]
	(prime[0], prime[1]) = (False, False)
	p = 2
	while p * p <= n:
		if prime[p] == True:
			for i in range(p * p, n + 1, p):
				prime[i] = False
		p += 1
	return prime
MAXN = int(100000.0 + 5)

def spf_sieve():
	spf[1] = 1
	for i in range(2, MAXN):
		spf[i] = i
	for i in range(4, MAXN, 2):
		spf[i] = 2
	for i in range(3, ceil(MAXN ** 0.5), 2):
		if spf[i] == i:
			for j in range(i * i, MAXN, i):
				if spf[j] == j:
					spf[j] = i
spf = [0 for i in range(MAXN)]

def factoriazation(x):
	res = []
	for i in range(2, int(x ** 0.5) + 1):
		while x % i == 0:
			res.append(i)
			x //= i
	if x != 1:
		res.append(x)
	return res

def int_array():
	return list(map(int, input().strip().split()))

def float_array():
	return list(map(float, input().strip().split()))

def str_array():
	return input().strip().split()
MOD = int(1000000000.0) + 7
CMOD = 998244353
INF = float('inf')
NINF = -float('inf')
from itertools import permutations
import math
from bisect import bisect_left

def solve():
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print('T')
		return
	m = max(a)
	s = sum(a) - m
	if m > s or sum(a) % 2 == 1:
		print('T')
	else:
		print('HL')
for _ in range(int(input())):
	solve()


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	count = 0
	q = 0
	for i in a:
		count += i
	for i in a:
		if i > count // 2:
			q = 1
			print('T')
			break
	if q == 0:
		if count % 2 == 0:
			print('HL')
		else:
			print('T')


import sys
import math
input = sys.stdin.readline
from functools import cmp_to_key

def pi():
	return int(input())

def pl():
	return int(input(), 16)

def ti():
	return list(map(int, input().split()))

def ts():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
mod = 1000000007
f = []

def fact(n, m):
	global f
	f = [1 for i in range(n + 1)]
	f[0] = 1
	for i in range(1, n + 1):
		f[i] = f[i - 1] * i % m

def fast_mod_exp(a, b, m):
	res = 1
	while b > 0:
		if b & 1:
			res = res * a % m
		a = a * a % m
		b = b >> 1
	return res

def inverseMod(n, m):
	return fast_mod_exp(n, m - 2, m)

def ncr(n, r, m):
	if r == 0:
		return 1
	return f[n] * inverseMod(f[n - r], m) % m * inverseMod(f[r], m) % m

def main():
	B()

def dfs(root, v, sub, parent):
	st = [root]
	while len(st) > 0:
		node = st.pop()
		for i in range(len(v[node])):
			if v[node][i] != node:
				st.append(v[node][i])

def D():
	try:
		t = pi()
		while t:
			t -= 1
			n = pi()
			v = [[] for i in range(n)]
			for i in range(n - 1):
				[x, y] = ti()
				v[x - 1].append(y - 1)
				v[y - 1].append(x - 1)
			m = pi()
			p = ti()
			e = [0 for i in range(n - 1)]
			sub = [0 for i in range(n)]
			dfs(0, v, sub, -1)
			for i in range(1, n):
				e[i - 1] = sub[i] * (n - sub[i])
			if len(p) < n - 1:
				while len(p) < n - 1:
					p.append(1)
			p = sorted(p)
			if len(p) > n - 1:
				x = 1
				for i in range(n - 2, len(p)):
					x = x * p[i]
				while len(p) > n - 2:
					p.pop()
				p.append(x)
			e = sorted(e)
			res = 0
			for i in range(n - 1):
				res = (res + p[i] * e[i]) % mod
			print(res)
	except:
		print(sys.exc_info())

def B():
	t = pi()
	while t:
		t -= 1
		n = pi()
		a = ti()
		s = 0
		mx = 0
		for i in range(n):
			s += a[i]
			mx = max(mx, a[i])
		if mx > s / 2:
			print('T')
		elif s % 2 == 0:
			print('HL')
		else:
			print('T')
main()


t = int(input())
for _ in range(t):
	n = int(input())
	piles = [int(i) for i in input().split()]
	s = sum(piles)
	done = False
	for p in piles:
		if 2 * p > s:
			print('T')
			done = True
			break
	if done:
		continue
	print('HL' if s % 2 == 0 else 'T')


import sys
input = iter(sys.stdin.read().splitlines()).__next__

def solve(N, A):
	if N == 1:
		return 'T'
	s = sum(A)
	m = max(A)
	if m > s - m:
		return 'T'
	return 'T' if s % 2 == 1 else 'HL'
TC = int(input())
for tc in range(TC):
	N = int(input())
	A = list(map(int, input().split()))
	res = solve(N, A)
	print(res)


import sys

def rl(proc=None):
	if proc is not None:
		return proc(sys.stdin.readline())
	else:
		return sys.stdin.readline().rstrip()

def srl(proc=None):
	if proc is not None:
		return list(map(proc, rl().split()))
	else:
		return rl().split()

def solve(A):
	tot = sum(A)
	mx = max(A)
	if mx > tot - mx:
		return 0
	if tot & 1:
		return 0
	return 1

def main():
	t = rl(int)
	for _ in range(t):
		n = rl(int)
		A = srl(int)
		print('HL' if solve(A) else 'T')
main()


import math
import itertools

def winner(piles, n):
	if piles[-1] > sum(piles) - piles[-1]:
		print('T')
	elif sum(piles) % 2 == 0:
		print('HL')
	else:
		print('T')
t = int(input())
for _ in range(t):
	n = int(input())
	piles = sorted(list(map(int, input().split(' '))))
	winner(piles, n)


ans = ''

def f(n, arr):
	if n == 1:
		return 'T'
	if arr[-1] * 2 > sum(arr):
		return 'T'
	if sum(arr) % 2:
		return 'T'
	return 'HL'
for _ in range(int(input())):
	n = int(input())
	arr = [int(s) for s in input().split()]
	arr = sorted(arr)
	print(f(n, arr) + '')
print(ans)


def L1():
	t = int(input())
	ans = []
	for j in range(t):
		piles = int(input())
		n = [int(i) for i in input().split()]
		s = int(sum(n) / 2)
		for i in range(piles):
			if n[i] > s:
				ans.append('T')
				break
		while len(ans) < j + 1:
			if sum(n) % 2 == 0:
				ans.append('HL')
			else:
				ans.append('T')
	for i in ans:
		print(i)
L1()


import sys
input = sys.stdin.readline
t = int(input())
for tests in range(t):
	n = int(input())
	A = list(map(int, input().split()))
	if n == 1:
		print('T')
	elif n == 2:
		if A[0] == A[1]:
			print('HL')
		else:
			print('T')
	else:
		SUM = sum(A)
		MAX = max(A)
		if MAX > SUM - MAX:
			print('T')
		elif SUM % 2 != 0:
			print('T')
		else:
			print('HL')


import sys
sys.setrecursionlimit(10000)
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort(reverse=True)
	if n != 1:
		while len(a) > 2:
			a[0] -= a[1] - a[2] + 1
			a[1] = a[2] - 1
			a = [i for i in a if i != 0]
			a.sort(reverse=True)
		if len(a) == 2:
			if a[0] != a[1]:
				print('T')
			else:
				print('HL')
		else:
			print('T')
	else:
		print('T')


def main():
	t: int = int(input())
	for _ in range(t):
		n: int = int(input())
		T: [int] = list(map(int, input().split(' ')))
		mx: int = max(T)
		sm: int = sum(T)
		if 2 * mx > sm:
			print('T')
		elif sm & 1 == 1:
			print('T')
		else:
			print('HL')
main()


from math import floor
t = int(input())
for test in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	arr.sort()
	s = sum(arr)
	if arr[-1] > s // 2 or s % 2:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	n = int(input())
	A = sorted(list(map(int, input().split())))
	if A[-1] > sum(A[:-1]):
		print('T')
	elif sum(A) % 2:
		print('T')
	else:
		print('HL')


def rainy(S, L):
	if sum(L) < 2 * max(L) or sum(L) % 2:
		return 'T'
	return 'HL'
C = int(input())
for i in range(C):
	S = int(input())
	L = list(map(int, input().split()))
	print(rainy(S, L))


for _ in range(int(input())):
	n = int(input())
	a = [int(i) for i in input().split()]
	if n == 1:
		print('T')
	elif n == 2:
		if a[0] == a[1]:
			print('HL')
		else:
			print('T')
	elif max(a) > sum(a) - max(a):
		print('T')
	else:
		num = sum(a) - n
		if num % 2 == 0 and n % 2 == 0:
			print('HL')
		elif num % 2 == 0 and n % 2 == 1:
			print('T')
		elif num % 2 == 1 and n % 2 == 0:
			print('T')
		elif num % 2 == 1 and n % 2 == 1:
			print('HL')


for t in range(int(input())):
	n = int(input())
	num = list(map(int, input().split()))
	val = max(num)
	su = sum(num)
	if val * 2 > su or su % 2 == 1:
		print('T')
	else:
		print('HL')


def win(a, last=-1):
	for (i, el) in enumerate(a):
		a2 = a[:]
		a2[i] -= 1
		if i != last and el > 0 and (not win(a2, i)):
			return True
	return False

def solve(a):
	s = sum(a)
	for i in a:
		if i > s - i:
			return True
	return s % 2 == 1
for t in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	print('T' if solve(a) else 'HL')


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	mx = max(a)
	sm = sum(a)
	if mx * 2 > sm or sm % 2:
		print('T')
	else:
		print('HL')


t = int(input())
while t:
	t -= 1
	n = int(input())
	a = list(map(int, input().split()))
	total = sum(a)
	maxi = max(a)
	if maxi > total - maxi:
		print('T')
		continue
	if total % 2 == 0:
		print('HL')
	else:
		print('T')


from sys import stdin
input = stdin.readline
for _ in range(int(input())):
	n = int(input())
	a = [int(x) for x in input().split()]
	if n == 1:
		print('T')
		continue
	if n == 2:
		if a[0] == a[1]:
			print('HL')
		else:
			print('T')
		continue
	a.sort()
	s = sum(a[:-1])
	if a[-1] > s:
		print('T')
		continue
	if a[-1] == s:
		print('HL')
		continue
	s += a[-1]
	s %= 2
	print('T' if s else 'HL')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	arr.sort(reverse=True)
	flag = True
	if n == 1:
		print('T')
	elif arr[0] > sum(arr[1:]):
		print('T')
	elif (sum(arr[1:]) - arr[0]) % 2 == 1:
		print('T')
	else:
		print('HL')


T = int(input())
for _ in range(T):
	(n, ar) = (int(input()), list(map(int, input().split())))
	ar.sort()
	(sm, psm, last) = (sum(ar), sum(ar) - ar[-1], ar[-1])
	if last > psm or sm % 2:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	ma = tot = 0
	for i in range(n):
		if arr[i] > ma:
			ma = arr[i]
		tot += arr[i]
	if ma * 2 > tot:
		print('T')
	elif tot & 1:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	cantidad = int(input())
	pilas = list(map(int, input().split()))
	pilaMasGrande = max(pilas)
	rocas = sum(pilas)
	if pilaMasGrande * 2 > rocas or rocas % 2 != 0:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	we = max(l)
	sm = 0
	for i in range(n):
		sm += l[i]
	sm -= we
	if we > sm:
		print('T')
	elif (sm + we) % 2 == 0:
		print('HL')
	else:
		print('T')


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	if n == 1:
		print('T')
	elif n == 2:
		if arr[0] == arr[1]:
			print('HL')
		else:
			print('T')
	else:
		mex = max(arr)
		tot = sum(arr)
		if mex > tot - mex:
			print('T')
		elif (tot + 1) % 2 == 0:
			print('T')
		else:
			print('HL')


from sys import stdin
import heapq
tt = int(stdin.readline())
for loop in range(tt):
	n = int(stdin.readline())
	a = list(map(int, stdin.readline().split()))
	q = []
	for i in a:
		heapq.heappush(q, -1 * i)
	f = 0
	g = 0
	while True:
		if len(q) == 0:
			print('HL')
			break
		f = heapq.heappop(q)
		f += 1
		if g != 0:
			heapq.heappush(q, g)
		if len(q) == 0:
			print('T')
			break
		g = heapq.heappop(q)
		g += 1
		if f != 0:
			heapq.heappush(q, f)


for s in [*open(0)][2::2]:
	s = sum((a := [*map(int, s.split())]))
	print('HTL'[s < 2 * max(map(int, a)) or s % 2::2])


for T in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	m = max(a)
	s = 0
	for i in a:
		s += i
	if m > s - m or s & 1 or n == 1:
		print('T')
	else:
		print('HL')


import sys
import heapq
t = int(sys.stdin.readline().strip())
for _ in range(t):
	n = int(sys.stdin.readline().strip())
	nums = list(map(lambda n: -1 * int(n), sys.stdin.readline().strip().split()))
	heapq.heapify(nums)
	t_win = False
	prev = 0
	while len(nums):
		val = heapq.heappop(nums)
		t_win = not t_win
		if prev != 0:
			heapq.heappush(nums, prev)
		prev = val + 1
	print('T' if t_win else 'HL')


import math
t = int(input())
for w in range(t):
	n = int(input())
	l = [int(i) for i in input().split()]
	s = sum(l)
	if max(l) * 2 > s:
		print('T')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


import math, sys, bisect, heapq
from collections import defaultdict, Counter, deque
from itertools import groupby, accumulate
int1 = lambda x: int(x) - 1
ilele = lambda : map(int, input().split())
alele = lambda : list(map(int, input().split()))
ilelec = lambda : map(int1, input().split())
alelec = lambda : list(map(int1, input().split()))

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]
MOD = 1000000000 + 7

def Y(c):
	print(['NO', 'YES'][c])

def y(c):
	print(['no', 'yes'][c])

def Yy(c):
	print(['No', 'Yes'][c])
for _ in range(int(input())):
	N = int(input())
	A = alele()
	H = []
	heapq.heapify(H)
	for i in A:
		heapq.heappush(H, (-i, -1))
	win = 0
	turn = 1
	while H:
		(x, y) = heapq.heappop(H)
		if y == turn - 1:
			if H:
				(x1, y1) = heapq.heappop(H)
				heapq.heappush(H, (x, y))
				x1 = x1 + 1
				if x1 != 0:
					heapq.heappush(H, (x1, turn))
				turn += 1
			else:
				break
		else:
			x = x + 1
			if x != 0:
				heapq.heappush(H, (x, turn))
			turn += 1
	print(['HL', 'T'][not turn % 2])


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	n = int(input())
	arr = [int(el) for el in input().split()]
	if n == 1:
		print('T')
	elif max(arr) > sum(arr) - max(arr):
		print('T')
	elif sum(arr) % 2 == 0:
		print('HL')
	else:
		print('T')


import sys
import math
import heapq
import bisect
from collections import Counter
from collections import defaultdict
from io import BytesIO, IOBase
import string

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		import os
		self.os = os
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None
		self.BUFSIZE = 8192

	def read(self):
		while True:
			b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, self.BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, self.BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			self.os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def get_int():
	return int(input())

def get_ints():
	return list(map(int, input().split(' ')))

def get_int_grid(n):
	return [get_ints() for _ in range(n)]

def get_str():
	return input().split(' ')

def yes_no(b):
	if b:
		return 'YES'
	else:
		return 'NO'

def binary_search(good, left, right, delta=1, right_true=False):
	limits = [left, right]
	while limits[1] - limits[0] > delta:
		if delta == 1:
			mid = sum(limits) // 2
		else:
			mid = sum(limits) / 2
		if good(mid):
			limits[int(right_true)] = mid
		else:
			limits[int(~right_true)] = mid
	if good(limits[int(right_true)]):
		return limits[int(right_true)]
	else:
		return False

def prefix_sums(a, drop_zero=False):
	p = [0]
	for x in a:
		p.append(p[-1] + x)
	if drop_zero:
		return p[1:]
	else:
		return p

def prefix_mins(a, drop_zero=False):
	p = [float('inf')]
	for x in a:
		p.append(min(p[-1], x))
	if drop_zero:
		return p[1:]
	else:
		return p

def solve_c():
	n = get_int()
	a = get_ints()
	S = sum(a)
	if S % 2 == 1 or max(a) > S // 2:
		return 'T'
	else:
		return 'HL'
t = get_int()
for _ in range(t):
	print(solve_c())


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	count = 0
	s = sum(arr)
	m1 = max(arr)
	while m1 > 0:
		i = arr.index(m1)
		arr[i] = -1
		m2 = m1
		m1 = max(arr)
		arr[i] = m2 - 1
		count += 1
	if count % 2 == 0:
		print('HL')
	else:
		print('T')


import sys
input = sys.stdin.readline
t = int(input())
from heapq import heappush, heappop
for i in range(t):
	n = int(input())
	A = list(map(int, input().split()))
	Q = []
	for i in A:
		heappush(Q, -i)
	if n == 1:
		print('T')
		continue
	a = -heappop(Q)
	b = -heappop(Q)
	w = -1
	while len(Q) > 0:
		c = -Q[0]
		a -= b - c + 1
		b -= b - c + 1
		if c > a and c > b:
			if a > 0:
				heappush(Q, -a)
			a = -heappop(Q)
			if len(Q) == 0:
				w = 0 if a > b else 1
				break
			if b > 0:
				heappush(Q, -b)
			b = -heappop(Q)
		elif c > b:
			if b > 0:
				heappush(Q, -b)
			b = -heappop(Q)
	if a > b:
		w = 1
	else:
		w = 0
	print('T' if w == 1 else 'HL')


import sys, math
import io, os
from bisect import bisect_left as bl, bisect_right as br, insort
from heapq import heapify, heappush, heappop
from collections import defaultdict as dd, deque, Counter

def data():
	return sys.stdin.readline().strip()

def mdata():
	return list(map(int, data().split()))

def outl(var):
	sys.stdout.write(' '.join(map(str, var)) + '\n')

def out(var):
	sys.stdout.write(str(var) + '\n')
from decimal import Decimal
mod = int(1000000000.0) + 7
INF = 10 ** 9
for t in range(int(data())):
	n = int(data())
	a = mdata()
	a.sort(reverse=True)
	(a1, b1) = (0, 0)
	if a[0] > sum(a) - a[0] or sum(a) % 2 == 1:
		out('T')
	else:
		out('HL')


t = int(input())
ans_arr = []
for i in range(t):
	n = int(input())
	a_list = list(map(int, input().split()))
	max_value = max(a_list)
	stone_inPile = sum(a_list)
	if max_value * 2 > stone_inPile or stone_inPile & 1:
		ans_arr.append('T')
	else:
		ans_arr.append('HL')
for j in ans_arr:
	print(j)


import os
from io import BytesIO
input = BytesIO(os.read(0, os.fstat(0).st_size)).readline

def lii():
	return list(map(int, input().split()))

def ii():
	return int(input())

def main():
	t = ii()
	for _ in range(t):
		n = ii()
		A = lii()
		if n == 1:
			print('T')
			continue
		elif n == 2:
			if A[0] != A[1]:
				print('T')
			else:
				print('HL')
			continue
		else:
			A.sort(reverse=True)
			s = sum(A)
			if A[0] > s - A[0] or s % 2 == 1:
				print('T')
			else:
				print('HL')
main()


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def N():
	return int(input())

def print_list(l):
	print(' '.join(map(str, l)))
for _ in range(N()):
	n = N()
	a = RLL()
	if n == 1:
		print('T')
	elif n == 2:
		if a[0] != a[1]:
			print('T')
		else:
			print('HL')
	else:
		ss = sum(a)
		mm = max(a)
		if 2 * mm > ss:
			print('T')
		else:
			tmp = ss - mm * 2
			if tmp & 1 == 0:
				print('HL')
			else:
				print('T')


from heapq import *
for _ in range(int(input())):
	n = int(input())
	a = [-int(i) for i in input().split()]
	heapify(a)
	c = 0
	cur = heappop(a) + 1
	while a:
		add = cur
		cur = heappop(a) + 1
		if add != 0:
			heappush(a, add)
		c ^= 1
	print(['T', 'HL'][c])


import math
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
mod = 10 ** 9 + 7
mod1 = 998244353
sys.setrecursionlimit(300000)
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
sys.setrecursionlimit(300000)

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class TreeNode:

	def __init__(self, k, v):
		self.key = k
		self.value = v
		self.left = None
		self.right = None
		self.parent = None
		self.height = 1
		self.num_left = 1
		self.num_total = 1

class AvlTree:

	def __init__(self):
		self._tree = None

	def add(self, k, v):
		if not self._tree:
			self._tree = TreeNode(k, v)
			return
		node = self._add(k, v)
		if node:
			self._rebalance(node)

	def _add(self, k, v):
		node = self._tree
		while node:
			if k < node.key:
				if node.left:
					node = node.left
				else:
					node.left = TreeNode(k, v)
					node.left.parent = node
					return node.left
			elif node.key < k:
				if node.right:
					node = node.right
				else:
					node.right = TreeNode(k, v)
					node.right.parent = node
					return node.right
			else:
				node.value = v
				return

	@staticmethod
	def get_height(x):
		return x.height if x else 0

	@staticmethod
	def get_num_total(x):
		return x.num_total if x else 0

	def _rebalance(self, node):
		n = node
		while n:
			lh = self.get_height(n.left)
			rh = self.get_height(n.right)
			n.height = max(lh, rh) + 1
			balance_factor = lh - rh
			n.num_total = 1 + self.get_num_total(n.left) + self.get_num_total(n.right)
			n.num_left = 1 + self.get_num_total(n.left)
			if balance_factor > 1:
				if self.get_height(n.left.left) < self.get_height(n.left.right):
					self._rotate_left(n.left)
				self._rotate_right(n)
			elif balance_factor < -1:
				if self.get_height(n.right.right) < self.get_height(n.right.left):
					self._rotate_right(n.right)
				self._rotate_left(n)
			else:
				n = n.parent

	def _remove_one(self, node):
		replacement = node.left or node.right
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = replacement
			else:
				node.parent.right = replacement
			replacement.parent = node.parent
			node.parent = None
		else:
			self._tree = replacement
			replacement.parent = None
		node.left = None
		node.right = None
		node.parent = None
		self._rebalance(replacement)

	def _remove_leaf(self, node):
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = None
			else:
				node.parent.right = None
			self._rebalance(node.parent)
		else:
			self._tree = None
		node.parent = None
		node.left = None
		node.right = None

	def remove(self, k):
		node = self._get_node(k)
		if not node:
			return
		if AvlTree._is_leaf(node):
			self._remove_leaf(node)
			return
		if node.left and node.right:
			nxt = AvlTree._get_next(node)
			node.key = nxt.key
			node.value = nxt.value
			if self._is_leaf(nxt):
				self._remove_leaf(nxt)
			else:
				self._remove_one(nxt)
			self._rebalance(node)
		else:
			self._remove_one(node)

	def get(self, k):
		node = self._get_node(k)
		return node.value if node else -1

	def _get_node(self, k):
		if not self._tree:
			return None
		node = self._tree
		while node:
			if k < node.key:
				node = node.left
			elif node.key < k:
				node = node.right
			else:
				return node
		return None

	def get_at(self, pos):
		x = pos + 1
		node = self._tree
		while node:
			if x < node.num_left:
				node = node.left
			elif node.num_left < x:
				x -= node.num_left
				node = node.right
			else:
				return (node.key, node.value)
		raise IndexError('Out of ranges')

	@staticmethod
	def _is_left(node):
		return node.parent.left and node.parent.left == node

	@staticmethod
	def _is_leaf(node):
		return node.left is None and node.right is None

	def _rotate_right(self, node):
		if not node.parent:
			self._tree = node.left
			node.left.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.left
			node.left.parent = node.parent
		else:
			node.parent.right = node.left
			node.left.parent = node.parent
		bk = node.left.right
		node.left.right = node
		node.parent = node.left
		node.left = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	def _rotate_left(self, node):
		if not node.parent:
			self._tree = node.right
			node.right.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.right
			node.right.parent = node.parent
		else:
			node.parent.right = node.right
			node.right.parent = node.parent
		bk = node.right.left
		node.right.left = node
		node.parent = node.right
		node.right = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	@staticmethod
	def _get_next(node):
		if not node.right:
			return node.parent
		n = node.right
		while n.left:
			n = n.left
		return n

class SegmentTree1:

	def __init__(self, data, default=0, func=lambda a, b: max(a, b)):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class SegmentTree:

	def __init__(self, data, default=0, func=lambda a, b: a + b):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD

def powm(a, n, m):
	if a == 1 or n == 0:
		return 1
	if n % 2 == 0:
		s = powm(a, n // 2, m)
		return s * s % m
	else:
		return a * powm(a, n - 1, m) % m

def sort_list(list1, list2):
	zipped_pairs = zip(list2, list1)
	z = [x for (_, x) in sorted(zipped_pairs)]
	return z

def product(l):
	por = 1
	for i in range(len(l)):
		por *= l[i]
	return por

def binarySearchCount(arr, n, key):
	left = 0
	right = n - 1
	count = 0
	while left <= right:
		mid = int((right + left) / 2)
		if arr[mid] < key:
			count = mid + 1
			left = mid + 1
		else:
			right = mid - 1
	return count

def countdig(n):
	c = 0
	while n > 0:
		n //= 10
		c += 1
	return c

def binary(x, length):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y

def countGreater(arr, n, k):
	l = 0
	r = n - 1
	leftGreater = n
	while l <= r:
		m = int(l + (r - l) / 2)
		if arr[m] >= k:
			leftGreater = m
			r = m - 1
		else:
			l = m + 1
	return n - leftGreater
for ik in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	if n == 1:
		print('T')
		continue
	l = [l[i] * -1 for i in range(n)]
	heapq.heapify(l)
	f = 0
	g = 0
	while True:
		if len(l) == 0:
			print('HL')
			break
		f = -heapq.heappop(l)
		f -= 1
		if g != 0:
			heapq.heappush(l, -g)
		if len(l) == 0:
			print('T')
			break
		g = -heapq.heappop(l)
		g -= 1
		if f != 0:
			heapq.heappush(l, -f)


t = int(input())
for i in range(t):
	n = int(input())
	l = list(map(int, input().split()[:n]))
	s = sum(l)
	if max(l) * 2 > s or s % 2 != 0:
		print('T')
	else:
		print('HL')


import sys
from collections import defaultdict as dd
from collections import deque
from functools import *
from fractions import Fraction as f
from copy import *
from bisect import *
from heapq import *
from math import *
from itertools import permutations, product

def eprint(*args):
	print(*args, file=sys.stderr)
zz = 1
if zz:
	input = sys.stdin.readline
else:
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('all.txt', 'w')

def inc(d, c):
	d[c] = d[c] + 1 if c in d else 1

def bo(i):
	return ord(i) - ord('A')

def li():
	return [int(xx) for xx in input().split()]

def fli():
	return [float(x) for x in input().split()]

def comp(a, b):
	if a > b:
		return 2
	return 2 if a == b else 0

def gi():
	return [xx for xx in input().split()]

def fi():
	return int(input())

def pro(a):
	return reduce(lambda a, b: a * b, a)

def swap(a, i, j):
	(a[i], a[j]) = (a[j], a[i])

def si():
	return list(input().rstrip())

def mi():
	return map(int, input().split())

def gh():
	sys.stdout.flush()

def isvalid(i, j):
	return 0 <= i < n and 0 <= j < n

def bo(i):
	return ord(i) - ord('a')

def graph(n, m):
	for i in range(m):
		(x, y) = mi()
		a[x].append(y)
		a[y].append(x)
t = fi()
while t > 0:
	t -= 1
	n = fi()
	a = li()
	p = sum(a) - max(a)
	q = max(a)
	if q > p:
		print('T')
	elif q == p and a.count(1) < n - 1 and (n > 2):
		print('T')
	elif n == 1:
		print('T')
	elif sum(a) % 2:
		print('T')
	else:
		print('HL')


import sys
input = sys.stdin.readline
for f in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	m = max(a)
	s = sum(a)
	if 2 * m > s:
		print('T')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


from heapq import heapify, heappush, heappop
for _ in range(int(input())):
	n = int(input())
	heap = [-i for i in list(map(int, input().split()))]
	heapify(heap)
	if -min(heap) > -sum(heap) + min(heap):
		print('T')
	else:
		a = b = 0
		while 1 > 0:
			a = -heappop(heap) - 1
			if len(heap) == 0:
				print('T')
				break
			if b != 0:
				heappush(heap, -b)
			b = -heappop(heap) - 1
			if len(heap) == 0:
				print('HL')
				break
			if a != 0:
				heappush(heap, -a)


import sys
input = sys.stdin.readline

def solve(n, a):
	if n == 1:
		print('T')
		return
	s = sum(a)
	if max(a) > s - max(a):
		print('T')
		return
	s -= n
	if s % 2 == 0:
		cur = 'T'
	else:
		cur = 'HL'
	if n % 2 == 0:
		print('T' if cur == 'HL' else 'HL')
	else:
		print(cur)
for nt in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	solve(n, a)


from sys import stdin
input = stdin.readline

def put():
	return map(int, input().split())

def fail():
	print(-1)
	exit()
t = int(input())
for _ in range(t):
	n = int(input())
	if n == 1:
		_ = input()
		print('T')
	else:
		l = list(put())
		x = 0
		m = max(l)
		for i in l:
			x += i
		if m > x - m or x % 2 == 1:
			print('T')
		else:
			print('HL')


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	sumA = sum(a)
	TWins = False
	for elem in a:
		if elem > sumA // 2:
			TWins = True
			break
	if TWins or sumA % 2 != 0:
		print('T')
	else:
		print('HL')


import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	max_a = max(a)
	nokori_a = sum(a) - max_a
	if nokori_a < max_a:
		print('T')
		continue
	if sum(a) % 2 == 0:
		print('HL')
	else:
		print('T')


t = int(input())
for _ in range(t):
	even = 0
	odd = 0
	n = int(input())
	l = list(map(int, input().split()))
	l.sort()
	if l[-1] > sum(l[:-1]):
		print('T')
	elif sum(l) % 2 == 0:
		print('HL')
	else:
		print('T')


T = int(input())
for _ in range(T):
	N = int(input())
	a = [int(x) for x in input().split(' ')]
	if max(a) * 2 > sum(a):
		print('T')
	else:
		print('T' if sum(a) % 2 else 'HL')


for w in range(eval(input())):
	n = eval(input())
	l = [int(i) for i in input().split()]
	s = sum(l)
	if max(l) * 2 > s or s % 2 == 1:
		print('T')
	else:
		print('HL')


import random
import datetime
import itertools
TC = int(input())
for tc in range(TC):
	p = int(input())
	piles = list(map(int, input().split()))
	mx = max(piles)
	s = sum(piles)
	if mx > s - mx or s % 2 == 1:
		print('T')
	else:
		print('HL')


t = int(input())
while t:
	t -= 1
	n = int(input())
	a = list(map(int, input().split()))
	if sum(a) % 2 or max(a) * 2 > sum(a):
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	n = int(input())
	l = [int(i) for i in input().split()]
	if max(l) > sum(l) - max(l):
		print('T')
	elif sum(l) % 2 == 0:
		print('HL')
	else:
		print('T')


games = int(input())
for game in range(games):
	n = int(input())
	ps = list(map(int, input().split()))
	max_v = max(ps)
	sum_v = sum(ps)
	if max_v > sum_v - max_v or sum_v % 2 == 1:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	total = int(input())
	num_l = list(map(int, input().split()))
	num_l.sort()
	num_l.reverse()
	if total == 1:
		print('T')
	elif total == 2:
		if num_l[0] == num_l[1]:
			print('HL')
		else:
			print('T')
	else:
		zero = 0
		while True:
			while num_l[1] >= num_l[2] and num_l[1] != 0:
				num_l[0] -= 1
				num_l[1] -= 1
			if num_l[1] == 0:
				zero += 1
			for count in range(1, total - 1):
				if num_l[count] < num_l[count + 1]:
					(num_l[count], num_l[count + 1]) = (num_l[count + 1], num_l[count])
				else:
					break
			if num_l[0] == 0:
				zero += 1
			for count in range(0, total - 1):
				if num_l[count] < num_l[count + 1]:
					(num_l[count], num_l[count + 1]) = (num_l[count + 1], num_l[count])
				else:
					break
			if zero == total:
				print('HL')
				break
			elif zero == total - 1:
				print('T')
				break


import sys
import math
from math import *
from collections import Counter, defaultdict

class PriorityQueue(object):

	def __init__(self):
		self.queue = []

	def __str__(self):
		return ' '.join([str(i) for i in self.queue])

	def isEmpty(self):
		return len(self.queue) == 0

	def insert(self, data):
		self.queue.append(data)

	def delete(self):
		try:
			max = 0
			for i in range(len(self.queue)):
				if self.queue[i] > self.queue[max]:
					max = i
			item = self.queue[max]
			del self.queue[max]
			return item
		except IndexError:
			print()

def main():
	n = int(input())
	arr = list(map(int, input().split()))
	q = PriorityQueue()
	for i in arr:
		q.insert(i)
	num1 = num2 = 0
	while True:
		if q.isEmpty():
			print('HL')
			return
		num1 = q.delete()
		if num2 > 1:
			q.insert(num2 - 1)
		if q.isEmpty():
			print('T')
			return
		num2 = q.delete()
		if num1 > 1:
			q.insert(num1 - 1)
for i in range(int(input())):
	main()


import os
import sys
from io import BytesIO, IOBase

def main():
	pass
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def binary(n):
	return bin(n).replace('0b', '')

def decimal(s):
	return int(s, 2)

def pow2(n):
	p = 0
	while n > 1:
		n //= 2
		p += 1
	return p

def isPrime(n):
	if n == 1:
		return False
	else:
		root = int(n ** 0.5)
		root += 1
		for i in range(2, root):
			if n % i == 0:
				return False
		return True
for xyz in range(0, int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	m = max(l)
	s = sum(l)
	if m > s - m:
		print('T')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


mod = 1000000007
eps = 10 ** (-9)

def main():
	import sys
	input = sys.stdin.readline
	for _ in range(int(input())):
		N = int(input())
		A = list(map(int, input().split()))
		A.sort()
		if sum(A) & 1:
			print('T')
		elif A[-1] * 2 > sum(A):
			print('T')
		else:
			print('HL')
main()


t = int(input())
answer = []
for test in range(t):
	n = int(input())
	liste = list(map(int, input().split(' ')))
	S = sum(liste)
	indicator = int(S / 2)
	bool = False
	for element in liste:
		if element > indicator:
			bool = True
			break
	if bool:
		answer.append('T')
	elif S % 2 == 0:
		answer.append('HL')
	else:
		answer.append('T')
print('\n'.join(answer))


import sys
input = sys.stdin.buffer.readline

def solve():
	n = int(input())
	alst = list(map(int, input().split()))
	if n == 1:
		print('T')
		return
	total = sum(alst)
	max_a = max(alst)
	if max_a * 2 > total:
		print('T')
	elif total % 2 == 0:
		print('HL')
	else:
		print('T')
t = int(input())
for _ in range(t):
	solve()


t = int(input())
for q in range(t):
	n = int(input())
	arr = [int(x) for x in input().split()]
	(sum, maximum) = (0, 0)
	for i in range(n):
		sum += arr[i]
		maximum = max(maximum, arr[i])
	if maximum > sum - maximum:
		print('T')
	elif sum % 2 == 0:
		print('HL')
	else:
		print('T')


import io
import os
import sys
from heapq import *
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

def printd(*args, **kwargs):
	pass

def get_str():
	return input().decode().strip()

def rint():
	return map(int, input().split())

def oint():
	return int(input())
t = oint()
for _ in range(t):
	n = oint()
	a = list(rint())
	for i in range(n):
		a[i] = a[i] * -1
	heapify(a)
	printd(a)
	prev = 0
	cnt = 0
	while a:
		cnt += 1
		aa = heappop(a)
		printd('cnt', cnt, a)
		if prev != 0:
			heappush(a, prev)
		aa += 1
		prev = aa
	if cnt % 2:
		print('T')
	else:
		print('HL')


from sys import stdin
input = stdin.buffer.readline
for _ in range(int(input())):
	n = int(input())
	(*a,) = map(int, input().split())
	idx = -1
	c = 0
	while 1:
		mx = 0
		tmp = -1
		for i in range(n):
			if i != idx and a[i] > mx:
				mx = a[i]
				tmp = i
		if mx == 0:
			print(['HL', 'T'][c])
			break
		idx = tmp
		a[idx] -= 1
		c ^= 1


def main():
	t = int(input())
	for i in range(t):
		n = int(input())
		a = tuple(map(int, input().split()))
		winner = who_wins(('T', 'HL'), a)
		print(winner)

def who_wins(players, field):
	players = tuple(players)
	field = sorted(field)
	max_value = field.pop()
	other_values_sum = sum(field)
	delta = max_value - other_values_sum
	if delta > 0:
		winner_index = 0
	elif delta == 0:
		winner_index = 1
	else:
		assert delta < 0
		winner_index = 1 if delta % 2 == 0 else 0
	return players[winner_index]
main()


import sys
input = sys.stdin.readline
t = int(input())
for i in range(t):
	n = int(input())
	a = [int(i) for i in input().split()]
	if n == 1:
		print('T')
	else:
		maxa = max(a)
		suma = sum(a)
		pq = suma - maxa
		if pq >= maxa:
			tmp = suma
		else:
			foo = max(0, maxa - (pq + 1))
			tmp = suma - foo
		if tmp & 1:
			print('T')
		else:
			print('HL')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	if n == 1:
		print('T')
	else:
		s = sum(a)
		m = max(a)
		check = abs(s - m)
		if check < m:
			print('T')
		elif s % 2 == 0:
			print('HL')
		else:
			print('T')


import math
import collections
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect_left as bsl
from bisect import bisect_right as bsr
import heapq as hq
setrecursionlimit(2 ** 20)
t = 1
t = int(stdin.readline())
for _ in range(t):
	n = int(stdin.readline())
	a = list(map(int, stdin.readline().rstrip().split()))
	if 2 * max(a) > sum(a):
		print('T')
		continue
	elif sum(a) % 2 == 1:
		print('T')
	else:
		print('HL')


t = int(input())
for _ in range(t):
	n = int(input())
	A = list(map(int, input().split()))
	M = max(A)
	if M * 2 > sum(A) or sum(A) % 2 == 1:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	n = int(input())
	l1 = list(map(int, input().split()))
	l1.sort()
	sum1 = sum(l1) - l1[-1]
	if l1[-1] > sum1:
		print('T')
	else:
		sum1 += l1[-1]
		if sum1 % 2 == 0:
			print('HL')
		else:
			print('T')


import heapq
t = int(input())
while t:
	n = int(input())
	l = list(map(int, input().split()))
	h = []
	for i in range(n):
		heapq.heappush(h, (-l[i], i))
	lol = 0
	prev1 = -1
	prev2 = -1
	lel = 0
	while h:
		if lol == 0:
			(val, ind) = heapq.heappop(h)
			val = -val
			if ind == prev2 and len(h) == 0:
				lel = 1
				print('HL')
				break
			elif ind == prev2:
				(val1, ind1) = heapq.heappop(h)
				heapq.heappush(h, (-val, ind))
				val = -val1
				ind = ind1
			val -= 1
			lol = 1 - lol
			prev1 = ind
			if val != 0:
				heapq.heappush(h, (-val, ind))
		else:
			(val, ind) = heapq.heappop(h)
			val = -val
			if ind == prev1 and len(h) == 0:
				print('T')
				lel = 1
				break
			elif ind == prev1:
				(val1, ind1) = heapq.heappop(h)
				heapq.heappush(h, (-val, ind))
				val = -val1
				ind = ind1
			val -= 1
			lol = 1 - lol
			prev2 = ind
			if val != 0:
				heapq.heappush(h, (-val, ind))
	if lel == 0:
		if lol == 0:
			print('HL')
		else:
			print('T')
	t -= 1


t = int(input())
for juego in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	maxx = 0
	summ = 0
	for i in range(n):
		if a[i] > maxx:
			maxx = a[i]
		summ += a[i]
	if maxx > summ - maxx:
		print('T')
	elif summ % 2:
		print('T')
	else:
		print('HL')


def case(a):
	if max(a) > sum(a) - max(a):
		return 0
	else:
		return not sum(a) % 2

def solve():
	for _ in range(int(input())):
		input()
		print(['T', 'HL'][case(list(map(int, input().split())))])
solve()


def solve():
	return
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	maxx = max(arr)
	suum = sum(arr)
	if suum % 2 != 0 or maxx > suum - maxx:
		print('T')
	else:
		print('HL')


t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	maxP = max(a)
	total = sum(a)
	if maxP << 1 > total or total & 1:
		print('T')
	else:
		print('HL')


import sys
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
import collections as cc
(t,) = I()
for _ in range(t):
	(n,) = I()
	l = sorted(I())
	nxt = 0
	if n == 1:
		nxt = 1
	elif n == 2:
		if l[0] != l[1]:
			nxt = 1
	else:
		s = sum(l)
		m = l[-1]
		if m > s - m:
			nxt = 1
		elif s % 2 != 0:
			nxt = 1
	print('HTL'[nxt::2])


testCases = int(input())
for i in range(testCases):
	numPiles = int(input())
	pile = list(map(int, input().split(' ')))
	maxNumber = max(pile)
	sumOfPile = sum(pile)
	if numPiles == 1:
		print('T')
	elif numPiles == 2:
		if pile[0] == pile[1]:
			print('HL')
		else:
			print('T')
	elif maxNumber > sumOfPile - maxNumber:
		print('T')
	elif sumOfPile % 2 == 1:
		print('T')
	else:
		print('HL')


from sys import stdin, stdout
input = stdin.readline
from heapq import heappop, heappush, heapify

def geti():
	return map(int, input().strip().split())

def getl():
	return list(map(int, input().strip().split()))

def gets():
	return input('')

def geta():
	return int(input())

def print_s(s):
	stdout.write(s + '\n')

def solve():
	for _ in range(geta()):
		n = geta()
		b = getl()
		if n == 1:
			print('T')
			continue
		a = []
		for i in range(n):
			heappush(a, b[i] * -1)
		while True:
			t = heappop(a) * -1
			if t == 0:
				print('HL')
				break
			hl = heappop(a) * -1
			if hl == 0:
				print('T')
				break
			heappush(a, (t - 1) * -1)
			heappush(a, (hl - 1) * -1)
solve()


for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	l.sort()
	c = sum(l)
	if l[-1] > c - l[-1]:
		print('T')
	elif sum(l) % 2 == 1:
		print('T')
	elif len(l) == 1:
		print('T')
	else:
		print('HL')


t = int(input())

def slv():
	n = int(input())
	a = list(map(int, input().split()))
	sm = sum(a)
	mx = max(a)
	if mx > sm - mx:
		print('T')
		return
	if sm & 1:
		print('T')
	else:
		print('HL')
	return
for i in range(t):
	slv()


for _ in range(int(input())):
	n = int(input())
	arr = sorted(list(map(int, input().split())))
	if n == 1:
		print('T')
	elif n == 2:
		if arr[0] == arr[1]:
			print('HL')
		else:
			print('T')
	else:
		m = arr[-1]
		s = sum(arr) - m
		if m > s:
			print('T')
		elif (s - m) % 2 == 0:
			print('HL')
		else:
			print('T')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	m = 0
	s = 0
	for i in a:
		m = max(m, i)
		s += i
	if m > s // 2:
		print('T')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


def solve():
	n = int(input())
	a = sorted(list(map(int, input().split())))
	if n < 2:
		print('T')
	else:
		s = 0
		for x in a[0:-1]:
			s += x
		if a[-1] > s or (s - a[-1]) % 2 == 1:
			print('T')
		else:
			print('HL')
t = int(input())
for _ in range(t):
	solve()


from collections import defaultdict
from math import inf
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	mi = min(arr)
	ans = 0
	su = 0
	res = 'T'
	for i in arr:
		ans += i - mi
		su += i
	if max(arr) > su - max(arr):
		print(res)
	else:
		if ans % 2 == 1:
			res = 'HL'
		if n % 2 == 1:
			if mi % 2 == 0:
				if res == 'T':
					print('HL')
				else:
					print('T')
			else:
				print(res)
		elif res == 'T':
			print('HL')
		else:
			print('T')


import sys
import math
import collections
import bisect
import string

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def get_list():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_string():
	return sys.stdin.readline().strip()
for t in range(int(input())):
	n = int(input())
	arr = get_list()
	val = sum(arr)
	if max(arr) * 2 > val or val % 2 == 1:
		print('T')
	else:
		print('HL')


mod = 10 ** 9 + 7

def solve():
	n = int(input())
	a = list(map(int, input().split()))
	f = 2
	if max(a) > sum(a) - max(a) or sum(a) % 2 > 0:
		f = 1
	print('T' if f == 1 else 'HL')
t = int(input())
while t > 0:
	solve()
	t -= 1


import sys
input = sys.stdin.buffer.readline

def solution():
	n = int(input())
	l = list(map(int, input().split()))
	s = sum(l)
	if max(l) > s // 2:
		print('T')
	elif s % 2:
		print('T')
	else:
		print('HL')
t = int(input())
for _ in range(t):
	solution()


import heapq
t = int(input())
for i in range(t):
	n = int(input())
	ar = list(map(int, input().split()))
	for j in range(n):
		ar[j] = -ar[j]
	heapq.heapify(ar)
	j = 0
	while len(ar) > 0:
		a = -heapq.heappop(ar)
		a -= 1
		j += 1
		turn = 'h'
		if len(ar) > 0:
			b = -heapq.heappop(ar)
			b -= 1
			j += 1
			turn = 't'
		if turn == 'h':
			break
		if a > 0:
			heapq.heappush(ar, -a)
		if b > 0:
			heapq.heappush(ar, -b)
	if turn == 't':
		print('HL')
	else:
		print('T')


def answer(n, A):
	p = 0
	last = -1
	while True:
		maxi = 0
		index = -1
		for i in range(n):
			if A[i] > maxi and i != last:
				maxi = A[i]
				index = i
		if index == -1:
			break
		else:
			A[index] -= 1
			last = index
			p += 1
	if p % 2 == 0:
		return 'HL'
	else:
		return 'T'
t = int(input())
for i in range(t):
	n = int(input())
	arr = list(map(int, input().split()))
	print(answer(n, arr))


t = int(input())
for i in range(t):
	n = int(input())
	a = [int(u) for u in input().split()]
	s = 0
	for i in a:
		s += i
	a.sort()
	if a[-1] > s // 2:
		print('T')
	elif s % 2 == 0:
		print('HL')
	else:
		print('T')


import os
import sys
from io import BytesIO, IOBase
import threading
from collections import defaultdict, Counter
import heapq
from math import ceil, floor

def main():
	n = int(input())
	arr = list(map(int, input().split()))
	q = [(-i, ind) for (ind, i) in enumerate(arr)]
	heapq.heapify(q)
	last = -1
	cnt = 0
	while len(q):
		(node, ind) = heapq.heappop(q)
		node = -node
		if ind == last:
			if len(q):
				(a, b) = (node, ind)
				(node, ind) = heapq.heappop(q)
				node = -node
				heapq.heappush(q, (-a, b))
			else:
				break
		if node - 1:
			heapq.heappush(q, (-(node - 1), ind))
		last = ind
		cnt += 1
	if cnt % 2:
		print('T')
	else:
		print('HL')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
for i in range(int(input())):
	main()


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	if n == 1:
		print('T')
	elif n == 2:
		if arr[0] == arr[1]:
			print('HL')
		else:
			print('T')
	elif sum(arr) & 1:
		print('T')
	else:
		arr.sort()
		if arr[len(arr) - 1] > sum(arr[:len(arr) - 1]):
			print('T')
		else:
			print('HL')


for _ in range(int(input())):
	n = int(input())
	stones = list(map(int, input().split()))
	stones.sort()
	if stones[-1] > sum(stones[:-1]) or n == 1 or sum(stones) % 2 == 1:
		print('T')
	else:
		print('HL')


import sys
input = sys.stdin.readline
import math
for _ in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	(s, mx) = (sum(l), max(l))
	s2 = s - mx
	if mx > s2:
		print('T')
	elif s & 1:
		print('T')
	else:
		print('HL')


def inp():
	return int(input())

def inlt():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
import heapq

def stone_games(nums: [int]) -> str:
	nums = list(map(lambda x: x * -1, nums))
	heapq.heapify(nums)
	t_val = -1
	hl_val = -1
	while True:
		t_val = heapq.heappop(nums) * -1
		if t_val <= 0:
			return 'HL'
		t_val -= 1
		heapq.heappush(nums, hl_val * -1)
		hl_val = heapq.heappop(nums) * -1
		if hl_val <= 0:
			return 'T'
		hl_val -= 1
		heapq.heappush(nums, t_val * -1)
game_count = inp()
for i in range(game_count):
	num_count = inp()
	nums = inlt()
	print(stone_games(nums))


t = int(input())
for you in range(t):
	n = int(input())
	l = input().split()
	li = [int(i) for i in l]
	z = sum(li)
	if z % 2:
		print('T')
		continue
	poss = 0
	for i in li:
		if 2 * i > z:
			poss = 1
			break
	if poss:
		print('T')
	else:
		print('HL')


import sys
import math, bisect
sys.setrecursionlimit(10 ** 5)
from collections import defaultdict
from itertools import groupby, accumulate
from heapq import heapify, heappop, heappush
from collections import deque, Counter, OrderedDict

def I():
	return int(sys.stdin.readline())

def neo():
	return map(int, sys.stdin.readline().split())

def Neo():
	return list(map(int, sys.stdin.readline().split()))
for _ in range(int(input())):
	n = I()
	A = Neo()
	A.sort()
	if sum(A[:-1]) < A[-1]:
		print('T')
	else:
		print(['HL', 'T'][sum(A) % 2])


import math
t = int(input())
for _ in range(t):
	n = int(input())
	a_vec = input().split(' ')
	a_vec = [int(a) for a in a_vec]
	s = sum(a_vec)
	mp = max(a_vec)
	if mp > math.floor(s / 2.0) or (mp <= math.floor(s / 2.0) and s % 2 != 0):
		print('T')
	else:
		print('HL')


import sys
input = sys.stdin.readline
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	sm = sum(a)
	if max(a) > sm // 2:
		print('T')
		continue
	if sm % 2:
		print('T')
	else:
		print('HL')


import sys

def input():
	return sys.stdin.readline().strip()

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def list4d(a, b, c, d, e):
	return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]

def ceil(x, y=1):
	return int(-(-x // y))

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST(N=None):
	return list(MAP()) if N is None else [INT() for i in range(N)]

def Yes():
	print('Yes')

def No():
	print('No')

def YES():
	print('YES')

def NO():
	print('NO')
INF = 10 ** 19
MOD = 10 ** 9 + 7
for _ in range(INT()):
	N = INT()
	A = LIST()
	mx = max(A)
	sm = sum(A)
	if mx > sm - mx:
		print('T')
	elif sm % 2 == 1:
		print('T')
	else:
		print('HL')


def solve():
	n = int(input())
	arr = sorted([int(x) for x in input().split()], reverse=True)

	def first_wins():
		print('T')

	def second_wins():
		print('HL')
	sm = sum(arr)
	if sm % 2 != 0 or n == 1:
		return first_wins()
	if arr[0] <= sm - arr[0]:
		return second_wins()
	return first_wins()
for _ in range(int(input())):
	solve()


import sys
import collections as cc
import random as rd
import math as mt
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
for tc in range(int(input())):
	(n,) = I()
	l = I()
	l.sort()
	ma = max(l)
	t = l.index(ma)
	cnt = 1
	l[t] -= 1
	while 1:
		mi = -10
		mii = n
		tf = 0
		for i in range(n):
			if l[i] and i != t:
				if l[i] > mi:
					tf = 1
					mi = l[i]
					mii = i
		if not tf:
			break
		if mi == 0:
			break
		cnt = (cnt + 1) % 2
		l[mii] -= 1
		t = mii
	print('T' if cnt else 'HL')


import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
from math import gcd, ceil

def pre(s):
	n = len(s)
	pi = [0] * n
	for i in range(1, n):
		j = pi[i - 1]
		while j and s[i] != s[j]:
			j = pi[j - 1]
		if s[i] == s[j]:
			j += 1
		pi[i] = j
	return pi

def prod(a):
	ans = 1
	for each in a:
		ans = ans * each
	return ans

def lcm(a, b):
	return a * b // gcd(a, b)

def binary(x, length=16):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y
for _ in range(int(input()) if True else 1):
	n = int(input())
	a = list(map(int, input().split()))
	print('T' if sum(a) % 2 or max(a) > sum(a) // 2 else 'HL')


from typing import List

def stonedGame(N: int, piles: List[int]) -> str:
	piles.sort(reverse=True)
	i = 0
	j = 1
	while i < len(piles) and j < len(piles):
		piles[i] -= 1
		piles[j] -= 1
		if piles[i] == 0:
			del piles[i]
			j = 0
			i = 1
		if piles[j] == 0:
			del piles[j]
			i = 0
			j = 1
		piles.sort(reverse=True)
	if i < len(piles):
		return 'T'
	return 'HL'
test_cases = int(input())
for _ in range(test_cases):
	N = int(input())
	piles = list(map(int, input().split(' ')))
	print(stonedGame(N, piles))


from bisect import *
from collections import *
from math import gcd, ceil, sqrt, floor, inf
from heapq import *
from itertools import *
from operator import add, mul, sub, xor, truediv, floordiv
from functools import *
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def RL():
	return map(int, sys.stdin.readline().rstrip().split())

def RLL():
	return list(map(int, sys.stdin.readline().rstrip().split()))

def N():
	return int(input())
from types import GeneratorType

def bootstrap(f, stack=[]):

	def wrappedfunc(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		else:
			to = f(*args, **kwargs)
			while True:
				if type(to) is GeneratorType:
					stack.append(to)
					to = next(to)
				else:
					stack.pop()
					if not stack:
						break
					to = stack[-1].send(to)
			return to
	return wrappedfunc
farr = [1]
ifa = []

def fact(x, mod=0):
	if mod:
		while x >= len(farr):
			farr.append(farr[-1] * len(farr) % mod)
	else:
		while x >= len(farr):
			farr.append(farr[-1] * len(farr))
	return farr[x]

def ifact(x, mod):
	global ifa
	ifa.append(pow(farr[-1], mod - 2, mod))
	for i in range(x, 0, -1):
		ifa.append(ifa[-1] * i % mod)
	ifa = ifa[::-1]

def per(i, j, mod=0):
	if i < j:
		return 0
	if not mod:
		return fact(i) // fact(i - j)
	return farr[i] * ifa[i - j] % mod

def com(i, j, mod=0):
	if i < j:
		return 0
	if not mod:
		return per(i, j) // fact(j)
	return per(i, j, mod) * ifa[j] % mod

def catalan(n):
	return com(2 * n, n) // (n + 1)

def linc(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t > f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rinc(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t < f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def ldec(f, t, l, r):
	while l < r:
		mid = (l + r) // 2
		if t < f(mid):
			l = mid + 1
		else:
			r = mid
	return l

def rdec(f, t, l, r):
	while l < r:
		mid = (l + r + 1) // 2
		if t > f(mid):
			r = mid - 1
		else:
			l = mid
	return l

def isprime(n):
	for i in range(2, int(n ** 0.5) + 1):
		if n % i == 0:
			return False
	return True

def binfun(x):
	c = 0
	for w in arr:
		c += ceil(w / x)
	return c

def lowbit(n):
	return n & -n

def inverse(a, m):
	a %= m
	if a <= 1:
		return a
	return (1 - inverse(m, a) * m) // a % m

class BIT:

	def __init__(self, arr):
		self.arr = arr
		self.n = len(arr) - 1

	def update(self, x, v):
		while x <= self.n:
			self.arr[x] += v
			x += x & -x

	def query(self, x):
		ans = 0
		while x:
			ans += self.arr[x]
			x &= x - 1
		return ans

class DSU:

	def __init__(self, n):
		self.c = [-1] * n

	def same(self, x, y):
		return self.find(x) == self.find(y)

	def find(self, x):
		if self.c[x] < 0:
			return x
		self.c[x] = self.find(self.c[x])
		return self.c[x]

	def union(self, u, v):
		(u, v) = (self.find(u), self.find(v))
		if u == v:
			return False
		if self.c[u] < self.c[v]:
			(u, v) = (v, u)
		self.c[u] += self.c[v]
		self.c[v] = u
		return True

	def size(self, x):
		return -self.c[self.find(x)]

class UFS:

	def __init__(self, n):
		self.parent = [i for i in range(n)]
		self.ranks = [0] * n

	def find(self, x):
		if x != self.parent[x]:
			self.parent[x] = self.find(self.parent[x])
		return self.parent[x]

	def union(self, u, v):
		(pu, pv) = (self.find(u), self.find(v))
		if pu == pv:
			return False
		if self.ranks[pu] >= self.ranks[pv]:
			self.parent[pv] = pu
			if self.ranks[pv] == self.ranks[pu]:
				self.ranks[pu] += 1
		else:
			self.parent[pu] = pv

def Prime(n):
	c = 0
	prime = []
	flag = [0] * (n + 1)
	for i in range(2, n + 1):
		if not flag[i]:
			prime.append(i)
			c += 1
		for j in range(c):
			if i * prime[j] > n:
				break
			flag[i * prime[j]] = prime[j]
			if i % prime[j] == 0:
				break
	return prime

def dij(s, graph):
	d = {}
	d[s] = 0
	heap = [(0, s)]
	seen = set()
	while heap:
		(dis, u) = heappop(heap)
		if u in seen:
			continue
		for v in graph[u]:
			if v not in d or d[v] > d[u] + graph[u][v]:
				d[v] = d[u] + graph[u][v]
				heappush(heap, (d[v], v))
	return d

def GP(it):
	return [(ch, len(list(g))) for (ch, g) in groupby(it)]

class DLN:

	def __init__(self, val):
		self.val = val
		self.pre = None
		self.next = None
t = N()
for i in range(t):
	n = N()
	a = RLL()
	heap = []
	for x in a:
		heappush(heap, (-x, -1))
	j = 1
	while heap:
		(x, turn) = heappop(heap)
		if turn == j - 1:
			if len(heap) == 0:
				break
			else:
				(y, t2) = heappop(heap)
				if y < -1:
					heappush(heap, (y + 1, j))
				heappush(heap, (x, turn))
		elif x < -1:
			heappush(heap, (x + 1, j))
		j += 1
	ans = 'HL' if j & 1 else 'T'
	print(ans)


for _ in range(int(input())):
	(n, lst) = (int(input()), sorted(map(int, input().split(' '))))
	print('T' if sum(lst) & 1 or n == 1 or lst[n - 1] > sum(lst) - lst[n - 1] else 'HL')


t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	if n == 1:
		print('T')
	else:
		total = sum(a)
		m = max(a)
		if total % 2 == 1 or m > total // 2:
			print('T')
		else:
			print('HL')


import sys
input = sys.stdin.readline
I = lambda : list(map(int, input().split()))
import collections as cc
(t,) = I()
for _ in range(t):
	(n,) = I()
	l = sorted(I())
	mx = max(l)
	cr = l.index(mx)
	nxt = 1
	l[cr] -= 1
	while 1:
		mx = ix = -1
		for i in range(n):
			if l[i] and i != cr:
				if l[i] > mx:
					mx = l[i]
					ix = i
		if ix == -1:
			break
		if mx == 0:
			break
		nxt = (nxt + 1) % 2
		l[ix] -= 1
		cr = ix
	print('HTL'[nxt::2])


def solve(L):
	if len(L) == 1:
		if L[0] == 0:
			return 0
		else:
			return 1
	L.sort()
	s = sum(L)
	k = L[-1]
	if k * 2 > s:
		return 1
	if s % 2:
		return 1
	else:
		return 0
for i in ' ' * int(input()):
	n = int(input())
	print(['HL', 'T'][solve(list(map(int, input().split())))])


def solve():
	n = int(input())
	a = list(map(int, input().split()))
	mx = max(a)
	s = sum(a)
	if s - mx < mx or s & 1:
		print('T')
	else:
		print('HL')
for _ in range(int(input())):
	solve()


import sys
input = sys.stdin.buffer.readline

def print(val):
	sys.stdout.write(val + '\n')

def prog():
	for _ in range(int(input())):
		n = int(input())
		a = list(map(int, input().split()))
		mx = max(a)
		s = sum(a)
		if mx > s // 2:
			print('T')
		elif s % 2 == 0:
			print('HL')
		else:
			print('T')
prog()


from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import *
from copy import *
from collections import deque
from collections import Counter as counter
from itertools import combinations as comb
from itertools import permutations as permutate
from bisect import bisect_left as bl
from bisect import bisect_right as br
from bisect import bisect
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
from types import GeneratorType

def iterative(f, stack=[]):

	def wrapped_func(*args, **kwargs):
		if stack:
			return f(*args, **kwargs)
		to = f(*args, **kwargs)
		while True:
			if type(to) is GeneratorType:
				stack.append(to)
				to = next(to)
				continue
			stack.pop()
			if not stack:
				break
			to = stack[-1].send(to)
		return to
	return wrapped_func
mod = 1000000007

def inp():
	return sys.stdin.readline().rstrip('\r\n')

def out(var):
	sys.stdout.write(str(var))

def lis():
	return list(map(int, inp().split()))

def stringlis():
	return list(map(str, inp().split()))

def sep():
	return map(int, inp().split())

def strsep():
	return map(str, inp().split())

def zerolist(n):
	return [0] * n

def nextline():
	out('\n')

def testcase(t):
	for pp in range(t):
		solve(pp)

def printlist(a):
	for p in range(0, len(a)):
		out(str(a[p]) + ' ')

def google(p):
	print('Case #' + str(p) + ': ', end='')

def lcm(a, b):
	return a * b // gcd(a, b)

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res

def ncr(n, r):
	return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def isPrime(n):
	if n <= 1:
		return False
	if n <= 3:
		return True
	if n % 2 == 0 or n % 3 == 0:
		return False
	i = 5
	while i * i <= n:
		if n % i == 0 or n % (i + 2) == 0:
			return False
		i = i + 6
	return True

def solve(case):
	n = int(inp())
	a = lis()
	h = []
	cnt = 0
	for i in range(n):
		heappush(h, -a[i])
	prev = -1
	while len(h) != 0:
		curr = heappop(h) * -1
		if prev > 0:
			heappush(h, -1 * prev)
		cnt = 1 - cnt
		curr -= 1
		prev = curr
	if cnt == 1:
		print('T')
	else:
		print('HL')
testcase(int(inp()))


from array import array
t_games = int(input())
for t in range(t_games):
	n = int(input())
	a = array('B', map(int, input().split()))
	T_pile = 0
	H_pile = 0
	while T_pile > 0 or H_pile > 0 or len(a) > 0:
		H_moved = 0
		if len(a) > 0 and max(a) > T_pile:
			if T_pile > 0:
				a.append(T_pile)
			T_pile = a.pop(a.index(max(a)))
		if len(a) > 0 and max(a) > H_pile:
			if H_pile > 0:
				a.append(H_pile)
			H_pile = a.pop(a.index(max(a)))
		if T_pile > 0:
			T_pile -= 1
		if H_pile > 0:
			H_pile -= 1
			H_moved = 1
	print('HL') if H_moved else print('T')


from sys import stdin, stdout
input = stdin.readline
print = lambda x: stdout.write(str(x) + '\n')
from heapq import *
for _ in range(int(input())):
	n = int(input())
	a = list(map(lambda x: -int(x), input().split()))
	heapify(a)
	while a:
		t = -heappop(a)
		if a:
			hl = -heappop(a)
		else:
			print('T')
			break
		if t - 1:
			heappush(a, 1 - t)
		if hl - 1:
			heappush(a, 1 - hl)
	else:
		print('HL')


import heapq as hq
for _ in range(int(input())):
	n = int(input())
	l = list(map(lambda x: -int(x), input().split()))
	if n == 1:
		print('T')
		continue
	f = 0
	hq.heapify(l)
	while True:
		x = hq.heappop(l)
		if x >= 0:
			break
		else:
			f = 1
			x += 1
			y = hq.heappop(l)
			if y >= 0:
				break
			else:
				f = 0
				y += 1
				hq.heappush(l, x)
				hq.heappush(l, y)
	if f == 0:
		print('HL')
	else:
		print('T')


n = int(input())
last = -1
pl = 0
loose = 0
pas = 0
for i in range(n):
	num = []
	ku = int(input())
	num = input()
	num = list(num.split(' '))
	for k in range(ku):
		num[k] = int(num[k])
	loose = 0
	last = -1
	pl = 0
	while loose == 0:
		pas = 0
		ma = 0
		for r in range(ku):
			if num[r] > ma:
				if num[r] != 0:
					if r != last:
						ma = num[r]
						ind = r
						pas = 1
		num[ind] -= 1
		last = ind
		pl += 1
		if pas == 0:
			loose = 1
	if pl % 2 == 0:
		print('T')
	else:
		print('HL')


from math import *
t = int(input())
for o in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort()
	a = a[::-1]
	f = 0
	if n == 1:
		print('T')
	else:
		i = 0
		j = 1
		if n > 2:
			m = a[2]
			pos = 2
		else:
			m = 0
			pos = 0
		cnt = 0
		f = 0
		while 1:
			if m == 0:
				break
			for k in range(n):
				if k != i and k != j:
					if a[k] > m:
						m = a[k]
						pos = k
			if a[i] < m:
				i = pos
				m = -1
			if a[j] < m:
				j = pos
				m = -1
			if f == 0:
				a[i] -= 1
				f = 1
			else:
				a[j] -= 1
				f = 0
			cnt += 1
		if a[i] > a[j]:
			print('T')
		elif a[j] > a[i]:
			print('HL')
		elif cnt % 2 == 0:
			print('HL')
		else:
			print('T')


import sys
readline = sys.stdin.readline
T = int(readline())
Ans = [None] * T
for qu in range(T):
	N = int(readline())
	A = list(map(int, readline().split()))
	A.sort()
	if N == 1:
		Ans[qu] = 'T'
	elif N == 2:
		if A[0] == A[1]:
			Ans[qu] = 'HL'
		else:
			Ans[qu] = 'T'
	elif A[-1] > sum(A[:-1]):
		Ans[qu] = 'T'
	elif sum(A) % 2 == 0:
		Ans[qu] = 'HL'
	else:
		Ans[qu] = 'T'
print('\n'.join(Ans))


for _ in range(int(input())):
	n = int(input())
	A = list(map(int, input().split()))
	A.sort()
	M = A[-1]
	S = sum(A) - M
	if M > S:
		print('T')
	elif (S + M) % 2:
		print('T')
	else:
		print('HL')


for _ in range(int(input())):
	n = int(input())
	stosy = sorted(list(map(int, input().split())))
	dlug = len(stosy)
	while dlug > 1:
		stosy[-2] -= 1
		if stosy[-2] == 0:
			del stosy[-2]
			dlug -= 1
		stosy[-1] -= 1
		if stosy[-1] == 0:
			del stosy[-1]
			dlug -= 1
		stosy.sort()
	if dlug == 1:
		print('T')
	else:
		print('HL')


from sys import stdin

class Input:

	def __init__(self):
		self.next = self.readline()

	def readline(self):
		return stdin.readline().strip()

	def line(self):
		try:
			return self.next
		finally:
			self.next = self.readline()

	def array(self, sep=' ', cast=int):
		return list(map(cast, self.line().split(sep=sep)))

	def known_tests(self):
		(num_of_cases,) = self.array()
		for case in range(num_of_cases):
			yield self

	def unknown_tests(self):
		while self.next:
			yield self

class Problem:

	def __init__(self, input):
		(n,) = input.array()
		a = input.array()
		s = sum(a)
		m = max(a)
		if n == 1:
			print('T')
		elif 2 * m > s:
			print('T')
		elif s % 2 == 0:
			print('HL')
		else:
			print('T')
for tc in Input().known_tests():
	Problem(tc)


test = int(input())
for t in range(0, test):
	n = int(input())
	a = [int(i) for i in input().split(' ')]
	m1 = max(a)
	c = 0
	a.remove(m1)
	while sum(a):
		m2 = max(a)
		a.append(m1 - 1)
		a.remove(m2)
		m1 = m2
		c += 1
	if c % 2:
		print('HL')
	else:
		print('T')


(T,) = map(int, input().split())
for _ in range(T):
	(N,) = map(int, input().split())
	X = list(map(int, input().split()))
	if N == 1:
		print('T')
		continue
	if N == 2:
		if X[0] == X[1]:
			print('HL')
		else:
			print('T')
		continue
	X.sort()
	if X[-1] > sum(X) - X[-1]:
		print('T')
		continue
	if sum(X) % 2 == 0:
		print('HL')
	else:
		print('T')


for t in range(int(input())):
	n = int(input())
	an = list(map(int, input().split()))
	winner = 0
	bm = 0
	cm = -1
	while bm != -1:
		bm = -1
		ma = 0
		for i in range(len(an)):
			if an[i] > ma and i != cm:
				bm = i
				ma = an[i]
		if bm != -1:
			an[bm] -= 1
			cm = bm
			winner = 1 - winner
	if winner == 0:
		print('HL')
	else:
		print('T')


from heapq import *
for _ in range(int(input())):
	n = int(input())
	s = list(map(lambda x: -int(x), input().split()))
	cs = sum(s)
	heapify(s)
	last = 0
	ans = 0
	while s:
		cur = heappop(s)
		if not cur:
			continue
		ans += 1
		if last:
			heappush(s, last)
		last = cur + 1
	if ans % 2:
		print('T')
	else:
		print('HL')


import sys
input = lambda : sys.stdin.readline().rstrip()
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	if 2 * max(a) > sum(a) or sum(a) % 2 == 1:
		print('T')
	else:
		print('HL')


n = int(input())
for i in range(n):
	stack = int(input())
	arr = input().split(' ')
	arr = [int(x) for x in arr]
	arr.sort()
	if len(arr) == 1:
		print('T')
	else:
		tmp = sum(arr[0:-1])
		if tmp < arr[-1]:
			print('T')
		elif (tmp + arr[-1]) % 2 == 0:
			print('HL')
		else:
			print('T')


for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	a.sort()
	s = sum(a)
	if a[n - 1] * 2 > s or s % 2 == 1:
		print('T')
	elif s % 2 == 0:
		print('HL')


K = int(input())
while K:
	k = int(input())
	aa = list(map(int, input().split(' ')))
	Ma = max(aa)
	Su = sum(aa)
	if Ma * 2 > Su or Su % 2 == 1:
		print('T')
	else:
		print('HL')
	K -= 1


t = int(input())
while t > 0:
	n = int(input())
	l = list(map(int, input().split()))
	ls = [0] * n
	tu = 0
	p = 0
	while True:
		m = 0
		ind = -1
		for i in range(n):
			if l[i] > m and ls[i] == 0:
				m = l[i]
				ind = i
		if ind == -1:
			break
		else:
			tu += 1
			l[ind] -= 1
			ls[p] = 0
			p = ind
			ls[p] = 1
	if tu % 2 == 0:
		print('HL')
	else:
		print('T')
	t -= 1


import sys
T = int(input())
for i in range(T):
	n = input()
	arr = [int(x) for x in input().split()]
	maks = max(arr)
	jumlah = sum(arr) - max(arr)
	if maks > jumlah:
		print('T')
	else:
		print('T' if (maks + jumlah) % 2 == 1 else 'HL')


from collections import Counter
from typing import *
t = int(input())
for _ in range(t):
	n = int(input())
	a = [int(x) for x in input().split()]
	(large, total) = (max(a), sum(a))
	if large > total // 2:
		print('T')
	elif total % 2:
		print('T')
	else:
		print('HL')


n = int(input())
for i in range(n):
	f = int(input())
	d = list(map(int, input().split()))[:f]
	d.sort()
	g = sum(d)
	if sum(d) % 2 == 0:
		if d[-1] > g - d[-1]:
			print('T')
		else:
			print('HL')
	else:
		print('T')


for _ in range(int(input())):
	n = int(input())
	ct = [0 for _ in range(100)]
	for x in input().split():
		ct[int(x) - 1] += 1
	j = -1
	while True:
		(aflag, bflag) = (False, False)
		for i in range(99, -1, -1):
			if ct[i] > 0:
				if i != j - 1 or ct[i] != 1:
					ct[i] -= 1
					if i > 0:
						ct[i - 1] += 1
					j = i
					aflag = True
					break
		if not aflag:
			print('HL')
			break
		for i in range(99, -1, -1):
			if ct[i] > 0:
				if i != j - 1 or ct[i] != 1:
					ct[i] -= 1
					if i > 0:
						ct[i - 1] += 1
					j = i
					bflag = True
					break
		if not bflag:
			print('T')
			break


import sys
import heapq, functools, collections
import math, random
from collections import Counter, defaultdict

def solve(lst):
	console('----- solving ------')
	lst = sorted(lst)[::-1]
	if lst[0] > sum(lst) / 2:
		return 'T'
	if sum(lst) % 2 == 1:
		return 'T'
	return 'HL'

def console(*args):
	print('\x1b[36m', *args, '\x1b[0m', file=sys.stderr)
	return
for case_num in range(int(input())):
	_ = int(input())
	lst = list(map(int, input().split()))
	res = solve(lst)
	print(res)


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nsmallest
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
from decimal import Decimal
mod = 10 ** 9 + 7
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(var, end='\n'):
	sys.stdout.write(str(var) + end)

def outa(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
for _ in range(int(data())):
	n = int(data())
	arr = l()
	if sum(arr) < 2 * max(arr) or sum(arr) & 1:
		out('T')
		continue
	out('HL')