#include <bits/stdc++.h>
using namespace std;
bool dfs(vector<int> a, int last) {
  for (int i = 0; i < a.size(); i++) {
    if (i == last) continue;
    if (a[i] == 0) continue;
    a[i]--;
    if (!dfs(a, i)) return true;
    a[i]++;
  }
  return false;
}
int main() {
  int _t;
  cin >> _t;
  for (int _ = 0; _ < _t; _++) {
    int n;
    cin >> n;
    vector<int> a(n);
    int maxi = 0;
    int sum = 0;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      sum += a[i];
      maxi = max(maxi, a[i]);
    }
    if (n == 2) {
      if (a[0] != a[1])
        cout << "T" << endl;
      else
        cout << "HL" << endl;
      continue;
    }
    if (maxi * 2 <= sum && n != 1 && sum % 2 == 0)
      cout << "HL" << endl;
    else
      cout << "T" << endl;
  }
  return 0;
}
