#include <bits/stdc++.h>
using namespace std;
long long n;
priority_queue<long long> q;
inline long long read() {
  long long x = 0, tmp = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') tmp = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 3) + (x << 1) + (ch ^ 48);
    ch = getchar();
  }
  return tmp * x;
}
inline void solve() {
  while (!q.empty()) {
    if (q.size() >= 2) {
      long long x = q.top();
      q.pop();
      long long y = q.top();
      q.pop();
      x--;
      y--;
      if (x) q.push(x);
      if (y) q.push(y);
    } else {
      printf("T\n");
      q.pop();
      return;
    }
  }
  printf("HL\n");
}
int main() {
  for (long long T = read(); T; T--) {
    n = read();
    while (n--) q.push(read());
    solve();
  }
  return 0;
}
