#include <bits/stdc++.h>
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<pair<int, int> > v;
  for (int i = 0; i < n; i++) {
    int x;
    cin >> x;
    v.push_back({x, i});
  }
  v.push_back({0, n});
  int flag = 0, prev = -1;
  while (1) {
    sort(v.begin(), v.end(), greater<pair<int, int> >());
    int crt = v[0].second;
    int pos;
    if (prev != crt) {
      prev = crt;
      pos = 0;
    } else {
      prev = v[1].second;
      pos = 1;
    }
    if (v[pos].first == 0)
      break;
    else {
      v[pos].first -= 1;
      flag ^= 1;
    }
  }
  if (flag == 0)
    cout << "HL"
         << "\n";
  else
    cout << "T"
         << "\n";
}
int main() {
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
}
