#include <bits/stdc++.h>
const long double PI = acos(-1);
using namespace std;
inline long long mod(long long n, long long m = 1000000007) {
  long long ret = n % m;
  if (ret < 0) ret += m;
  return ret;
}
long long exp(long long n, long long k) {
  if (k == 0) return 1;
  if (k == 1) return n;
  long long ax = exp(n, k / 2);
  ax = mod(ax * ax);
  if (k % 2) ax = mod(ax * n);
  return ax;
}
long long gcd(long long a, long long b) {
  if (a == 0)
    return b;
  else
    return gcd(b % a, a);
}
void solution() {
  long long n;
  cin >> n;
  long long sum = 0;
  long long x;
  long long mx = 0;
  for (long long i = 0; i < n; i += 1) {
    cin >> x;
    sum += x;
    mx = max(mx, x);
  }
  if (mx > sum - mx)
    cout << "T" << '\n';
  else if (sum % 2)
    cout << "T" << '\n';
  else
    cout << "HL" << '\n';
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  long long t = 1;
  cin >> t;
  while (t--) solution();
}
