#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
const long long mod = 1e9 + 7;
template <typename T>
inline T gcd(T a, T b) {
  return !b ? a : gcd(b, a % b);
}
template <typename T>
inline T q_pow(T a, T x) {
  T ans = 1, tmp = a;
  while (x) {
    if (x & 1) (ans *= tmp) %= mod;
    (tmp *= tmp) %= mod;
    x >>= 1;
  }
  return ans;
}
template <typename T>
inline void re(T &N) {
  int f = 1;
  char c;
  while ((c = getchar()) < '0' || c > '9')
    if (c == '-') f = -1;
  N = c - '0';
  while ((c = getchar()) >= '0' && c <= '9') N = N * 10 + c - '0';
  N *= f;
}
int m, n, t = 1, st, en;
int a[N], b[N];
char s[N];
int main() {
  re(t);
  while (t--) {
    re(n);
    priority_queue<int> q;
    for (int i = 1; i <= n; i++) {
      int x;
      re(x);
      q.push(x);
    }
    int flag = 0;
    if (q.size() == 1) {
      puts("T");
      continue;
    }
    a[flag] = q.top();
    q.pop();
    a[flag ^ 1] = q.top();
    q.pop();
    for (;; flag ^= 1) {
      if (a[flag] - 1) q.push(a[flag] - 1);
      if (!q.size()) break;
      a[flag] = q.top();
      q.pop();
    }
    puts(flag ? "T" : "HL");
  }
}
