#include <bits/stdc++.h>
using namespace std;
long long a[200010];
signed main() {
  long long Q, n;
  cin >> Q;
  while (Q--) {
    cin >> n;
    priority_queue<long long> q;
    for (long long i = 1; i <= n; i++) cin >> a[i], q.push(a[i]);
    long long rd = 0, lst = 0;
    while (!q.empty()) {
      long long x = q.top();
      q.pop();
      if (x == 0) {
        if (rd % 2)
          puts("T");
        else
          puts("HL");
        break;
      }
      q.push(lst);
      rd++;
      lst = --x;
    }
  }
  return 0;
}
