#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-10, pi = 3.1415926535898;
const int mod = 1e9 + 7, maxn = 2e5 + 10;
int T, n, m, k, x, y, a[maxn], b[maxn];
char st[maxn];
long long fac[maxn] = {1, 1}, inv[maxn] = {1, 1}, fac_inv[maxn] = {1, 1};
void init() {
  for (int i = 2; i < maxn; ++i) {
    fac[i] = i * fac[i - 1] % mod;
    inv[i] = (mod - mod / i) * inv[mod % i] % mod;
    fac_inv[i] = fac_inv[i - 1] * inv[i] % mod;
  }
}
long long C(int n, int m) {
  if (n < m or m < 0) return 0;
  return fac[n] * fac_inv[n - m] % mod * fac_inv[m] % mod;
}
struct P {
  int x, y;
  bool operator<(const P& a) const {
    if (x == a.x) return y < a.y;
    return x < a.x;
  }
};
int main(int argc, char const* argv[]) {
  T = 1;
  scanf("%d", &T);
  for (int _ = 1; _ <= T; ++_) {
    long long ans = 0;
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i) {
      scanf("%d", &a[i]);
      ans += a[i];
    }
    sort(a + 1, a + n + 1);
    if (a[n] * 2 > ans or ans % 2 == 1) {
      printf("T\n");
    } else {
      printf("HL\n");
    }
  }
  return 0;
}
