#include <bits/stdc++.h>
using namespace std;
int t, n, a[100];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  bool fla;
  while (t--) {
    cin >> n;
    for (register int i = (0); i < (n); ++i) cin >> a[i];
    if (n == 1)
      fla = true;
    else if (n == 2) {
      fla = (a[0] != a[1]);
    } else {
      sort(a, a + n);
      int s = 0;
      for (register int i = (0); i < (n - 1); ++i) s += a[i];
      if (a[n - 1] > s)
        fla = true;
      else {
        int x = s - a[n - 1];
        fla = (x % 2 > 0);
      }
    }
    if (fla)
      cout << "T" << endl;
    else
      cout << "HL" << endl;
  }
  return 0;
}
