#include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 7;
const long long MAX = 1e15;
const long long MOD = 1e9 + 7;
int n, a[1005];
void solve() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int player = 0, cur[2] = {-1, -1};
  while (1) {
    int ma = 0, pos = 0;
    for (int i = 1; i <= n; i++) {
      if (cur[player ^ 1] != i) {
        if (a[i] >= ma) {
          pos = i;
          ma = a[i];
        }
      }
    }
    if (ma == 0) {
      cout << (player ? "T" : "HL");
      return;
    }
    cur[player] = pos;
    a[pos]--;
    player ^= 1;
  }
}
int main() {
  ios::sync_with_stdio(0);
  if (1) {
    int t;
    cin >> t;
    for (int i = 1; i <= t; i++) {
      solve();
      cout << "\n";
    }
  } else
    solve();
  return 0;
}
