#include <bits/stdc++.h>
using ll = long long int;
using namespace std;
ll power(ll n, ll k) {
  ll res = 1;
  while (k) {
    if (k & 1) {
      res *= n;
      k--;
    } else {
      n *= n;
      k /= 2;
    }
  }
  return res;
}
void solve() {
  ll n;
  cin >> n;
  vector<ll> ar(n);
  ll sum = 0;
  for (auto &it : ar) cin >> it, sum += it;
  ll mx = *max_element(ar.begin(), ar.end());
  if (mx > sum - mx)
    cout << "T\n";
  else if (sum & 1)
    cout << "T\n";
  else
    cout << "HL\n";
}
int main() {
  int tc;
  cin >> tc;
  while (tc--) {
    solve();
  }
  return 0;
}
