#include <bits/stdc++.h>
using namespace std;
const int maxn = 100 + 10;
int a[maxn];
int main() {
  int t;
  cin >> t;
  while (t--) {
    priority_queue<int> q;
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
      q.push(a[i]);
    }
    if (n == 1) {
      puts("T");
      continue;
    }
    int t1 = 0, t2 = 0;
    bool flag = false;
    while (1) {
      q.push(t1);
      t1 = q.top();
      q.pop();
      if (t1 < 1) {
        cout << "HL\n";
        break;
      }
      t1--;
      q.push(t2);
      t2 = q.top();
      q.pop();
      if (t2 < 1) {
        cout << "T\n";
        break;
      }
      t2--;
    }
  }
  return 0;
}
