#include <bits/stdc++.h>
using namespace std;
int n;
int a[100001];
bool solve() {
  int mx = 0;
  long long cnt = 0;
  for (int i = 0; i < n; i++) {
    mx = max(mx, a[i]);
    cnt += a[i];
  }
  if (cnt % 2 == 1) return false;
  if (mx > cnt - mx) return false;
  return true;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  while (t--) {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    cout << (solve() ? "HL" : "T") << endl;
  }
  return 0;
}
