#include <bits/stdc++.h>
using namespace std;
vector<vector<long long> > adj(100005);
vector<long long> vis(100005);
vector<pair<long long, long long> > a;
void dfs(long long node) {
  vis[node] = 1;
  for (auto it : adj[node]) {
    if (!(vis[it])) {
      dfs(it);
    }
  }
}
long long fxp(long long base, long long expo) {
  if (expo == 0) return 1;
  if (expo % 2 == 0) {
    long long c = fxp(base, expo / 2);
    return ((c * c));
  } else
    return ((base * fxp(base, expo - 1)));
}
double nthRoot(long long A, long long N) {
  double xPre = rand() % 10;
  double eps = 1e-3;
  double delX = INT_MAX;
  double xK;
  while (delX > eps) {
    xK = ((N - 1.0) * xPre + (double)A / pow(xPre, N - 1)) / (double)N;
    delX = abs(xK - xPre);
    xPre = xK;
  }
  return xK;
}
long long product_subarrays(long long arr[], long long n) {
  long long res = 1;
  for (long long i = 0; i < n; i++) {
    long long product = 1;
    for (long long j = i; j < n; j++) {
      product = product * arr[j];
      res *= product;
    }
  }
  return (res);
}
long long gcd(long long p, long long q) {
  long long x, a, b;
  a = max(p, q);
  b = min(p, q);
  if (b == 0)
    return a;
  else {
    x = a % b;
    return (gcd(b, x));
  }
}
long long lcm(long long a, long long b) { return ((a * b) / gcd(a, b)); }
long long minPower(long long n, long long x) {
  if (x == 1) return n;
  long long ans = 0;
  while (n > 0) {
    ans += (n % x);
    n /= x;
  }
  return ans;
}
void solve() {
  long long n, m;
  cin >> n;
  long long a[n];
  long long s = 0;
  long long mx = 0;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    s += a[i];
    mx = max(a[i], mx);
  }
  if (mx > s / 2) {
    cout << "T" << '\n';
  } else if (s % 2 == 0) {
    cout << "HL" << '\n';
  } else
    cout << "T" << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
  return 0;
}
