#include <bits/stdc++.h>
using namespace std;
void solve() {
  long long int n, i, l, r, pre = -1, move = 0;
  cin >> n;
  long long int a[n + 1];
  for (i = 0; i < n; i++) {
    cin >> a[i];
  }
  priority_queue<pair<long long int, long long int>> pq;
  for (i = 0; i < n; i++) {
    pq.push({a[i], i});
  }
  while (pq.size() > 0) {
    pair<long long int, long long int> p = pq.top();
    pq.pop();
    if (pre != p.second) {
      p.first--;
      pre = p.second;
      if (p.first > 0) {
        pq.push(p);
      }
      move++;
    } else if (pq.size() > 0) {
      pair<long long int, long long int> pr = pq.top();
      pq.pop();
      pr.first--;
      pre = pr.second;
      if (pr.first > 0) {
        pq.push(pr);
      }
      pq.push(p);
      move++;
    } else {
      break;
    }
  }
  if (move % 2 == 1) {
    cout << "T\n";
  } else {
    cout << "HL\n";
  }
}
int main() {
  long long int tc = 1;
  cin >> tc;
  while (tc-- > 0) {
    solve();
  }
}
