#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
const long long int inf = 9e18;
const long double pi = 2 * acos(0.0);
const int N = 1000005;
long long int tes, n;
vector<long long int> sieve(N, 0);
void si() {
  sieve[1] = 1;
  for (int i = 2; i < N; i++) {
    if (sieve[i] == 0) {
      for (int j = i; j < N; j += i) {
        sieve[j] = i;
      }
    }
  }
}
long long int power(long long int x, long long int y) {
  long long int res = 1ll;
  while (y > 0) {
    if (y & 1) res = res * x;
    y >>= 1;
    x = x * x;
  }
  return res;
}
void solve() {
  cin >> n;
  vector<long long int> arr(n);
  multiset<long long int, greater<long long int>> st;
  ;
  for (int i = 0; i < n; i++) {
    cin >> arr[i];
    st.insert(arr[i]);
  }
  auto it = st.begin();
  long long int pre = *it;
  st.erase(it);
  bool val = false;
  while ((int)((st).size()) > 0) {
    it = st.begin();
    long long int temp = *it;
    st.erase(it);
    if (pre > 1) {
      st.insert(pre - 1);
    }
    pre = temp;
    if (val)
      val = false;
    else
      val = true;
  }
  if (!val)
    cout << "T"
         << "\n";
  else
    cout << "HL"
         << "\n";
}
int32_t main(void) {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  cin >> tes;
  while (tes--) {
    solve();
  }
}
