#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
const long long N = 1e6 + 10;
void solve() {
  long long n;
  cin >> n;
  long long a[n];
  priority_queue<long long> pq;
  for (auto &e : a) {
    cin >> e;
    pq.push(e);
  }
  long long prev = -1, turn = 0;
  while (pq.size() != 0) {
    long long top = pq.top();
    pq.pop();
    top--;
    if (prev > 0) pq.push(prev);
    prev = top;
    turn ^= 1;
  }
  if (turn == 0)
    cout << "HL\n";
  else
    cout << "T\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long te = 1;
  cin >> te;
  while (te--) solve();
  return 0;
}
