#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long n, x;
  cin >> n;
  priority_queue<long long> pq;
  for (long long i = 0; i < n; i++) {
    cin >> x;
    pq.push(x);
  }
  while (!pq.empty()) {
    long long a = pq.top();
    pq.pop();
    if (pq.empty()) {
      cout << "T\n";
      return;
    }
    long long b = pq.top();
    pq.pop();
    if (a > 1) pq.push(a - 1);
    if (b > 1) pq.push(b - 1);
  }
  cout << "HL\n";
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout.precision(10);
  cout << fixed;
  long long t;
  cin >> t;
  while (t--) solve();
  return 0;
}
