#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
const long long mod = 1000000007;
int main() {
  int t;
  cin >> t;
  while (t--) {
    int n, a[N], sum = 0, maxi = 0;
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      sum += a[i];
      maxi = max(maxi, a[i]);
    }
    sum -= maxi;
    if (maxi > sum)
      cout << "T" << endl;
    else if (sum % 2 == maxi % 2)
      cout << "HL" << endl;
    else
      cout << "T" << endl;
  }
  return 0;
}
