#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 10;
const long long int LINF = 1LL * INF * INF;
const int MAXN = 2e5 + 10;
const int MAXM = 5e3 + 10;
priority_queue<int> pq;
vector<vector<int> > graph;
queue<int> que;
int A[MAXN];
char S[MAXN];
int main() {
  int n, m, k, a, b, x, y, q;
  int sum = 0;
  int cnt = 0;
  int mx = 0;
  int mn = INF;
  int cur = 0, idx = -1;
  int tc;
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> tc;
  while (tc--) {
    cin >> n;
    mx = 0;
    sum = 0;
    for (int i = 1; i <= n; i++) {
      cin >> x;
      sum += x;
      mx = max(mx, x);
    }
    if ((mx << 1) > sum)
      cout << "T\n";
    else if ((mx << 1) == sum)
      cout << "HL\n";
    else {
      if (sum & 1)
        cout << "T\n";
      else
        cout << "HL\n";
    }
  }
  return 0;
}
