#include <bits/stdc++.h>
const int maxn = 5e5 + 10;
const int mod = 1e9 + 7;
using namespace std;
int n;
int a[105];
void solve() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  int ans = 1;
  int pre = n + 1;
  int hhh = 0;
  while (1) {
    int step = n + 1;
    hhh++;
    for (int i = 0; i < n; i++) {
      if (a[i] > a[step] && i != pre) step = i;
      hhh++, hhh++, hhh++;
    }
    hhh++;
    hhh++;
    if (step != n + 1)
      a[step]--, ans = -ans, pre = step;
    else
      break;
    hhh++;
    hhh++, hhh++;
  }
  printf("%s\n", ans == 1 ? "HL" : "T");
  hhh++, hhh++, hhh++;
}
int main() {
  int T;
  scanf("%d", &T);
  while (T--) solve();
  return 0;
}
