#include <bits/stdc++.h>
using namespace std;
const long long N = 1000006, INF = 1e18, MOD = 1e9 + 7;
long long n, m, r, c, t, a[N], b[N], f[N], q = 1, e, o, u, k, x, y, ans, Ans[N],
                                           mx;
vector<long long> v[N];
string s, ss[N];
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0);
  cin >> q;
  while (q--) {
    ans = x = y = o = u = mx = 0;
    e = INF;
    cin >> n;
    for (int i = 1; i <= n; i++) {
      cin >> a[i];
      mx = max(a[i], mx);
      x += a[i];
    }
    if (mx * 2 > x || x % 2) {
      cout << "T" << endl;
    } else {
      cout << "HL" << endl;
    }
  }
}
