#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
const long long N = 5e5 + 100, OO = 1e9 + 7, K = 112, T = 22, M = 1e9 + 7,
                P = 6151, SQ = 1300, lg = 22;
long long a[N];
void solve() {
  long long n, sum = 0;
  cin >> n;
  for (long long i = 0; i < n; i++) cin >> a[i], sum += a[i];
  sort(a, a + n);
  sum -= a[n - 1];
  if (sum < a[n - 1] || (sum + a[n - 1]) % 2 == 1)
    cout << "T" << endl;
  else
    cout << "HL" << endl;
}
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  long long t;
  cin >> t;
  while (t--) solve();
  return 0;
}
