#include <bits/stdc++.h>
using namespace std;
void tempwj() {
  freopen("hash.in", "r", stdin);
  freopen("hash.out", "w", stdout);
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long qpow(long long a, long long b, long long mod) {
  a %= mod;
  long long ans = 1;
  while (b > 0) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
struct cmp {
  bool operator()(const pair<int, long long>& a,
                  const pair<int, long long>& b) {
    return a.second > b.second;
  }
};
int lb(int x) { return x & -x; }
const int inf = INT_MAX;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const long long mod = 1e9 + 7;
const int maxn = 2e5 + 10;
const int M = 1e6 + 2;
int a[maxn];
int main() {
  int T;
  scanf("%d", &T);
  while (T--) {
    int n;
    scanf("%d", &n);
    int minn = 0;
    int s = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      minn = max(minn, a[i]);
    }
    int f = 1;
    for (int i = 1; i <= n; i++) {
      if (minn == a[i] && f) {
        f = 0;
      } else
        s += a[i];
    }
    if (minn > s) {
      printf("T\n");
    } else {
      s += minn;
      if (n > 2 && s % 2 == 1) {
        printf("T\n");
      } else
        printf("HL\n");
    }
  }
}
