#include <bits/stdc++.h>
using namespace std;
const long long INF = (long long)1e18;
const int mod = (int)1e9 + 7;
const int MAXN = (int)3e5 + 5;
long long n;
int a[MAXN];
void solve() {
  cin >> n;
  int top = 0;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    top += a[i];
  }
  sort(a, a + n);
  int last = -1;
  int turn = 1;
  for (int j = 0; j < top + 1; j++) {
    for (int i = n - 1; i >= -1; i--) {
      if (i == -1) {
        if (turn == 1) {
          cout << "HL" << '\n';
          return;
        } else {
          cout << "T" << '\n';
          return;
        }
      }
      if (i == last) continue;
      if (a[i] == 0) {
        if (turn == 1) {
          cout << "HL" << '\n';
          return;
        } else {
          cout << "T" << '\n';
          return;
        }
      } else {
        a[i]--;
        turn = 3 - turn;
        int idx = i;
        while (idx && a[idx] < a[idx - 1]) {
          swap(a[idx], a[idx - 1]);
          idx--;
        }
        last = idx;
        break;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}
