#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int lowbit(int x) { return x & -x; }
int c[N];
int n;
void modify(int x, int d) {
  for (int i = x; i <= n; i += lowbit(i)) c[i] += d;
}
int getsum(int x) {
  int sum = 0;
  for (int i = x; i >= 1; i -= lowbit(i)) sum += c[i];
  return sum;
}
int a[N];
bool dfs(int n, int p) {
  bool f = 0, ans = 0;
  for (int i = 1; i <= n; i++) {
    if (i == p) continue;
    if (a[i]) {
      a[i]--;
      ans |= !dfs(n, i);
      a[i]++;
      f = 1;
    }
  }
  if (!f) return 0;
  return ans;
}
int main() {
  int T;
  scanf("%d", &T);
  for (; T--;) {
    int n;
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
    }
    sort(a + 1, a + n + 1);
    int cnt = 0;
    bool f = 0;
    for (int i = 1; i < n; i++) {
      cnt += a[i];
    }
    if (cnt < a[n])
      f = 1;
    else {
      f = (n & 1) ^ ((cnt + a[n] - n) & 1);
    }
    puts(f ? "T" : "HL");
  }
}
