#include <bits/stdc++.h>
using pii = std::pair<long long, long long>;
using namespace std;
const long long maxn = 105;
long long t, n, a[maxn];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> t;
  for (long long cases = 0; cases < t; cases++) {
    cin >> n;
    for (long long i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    long long sum = 0;
    for (long long i = 0; i < n - 1; i++) sum += a[i];
    if (a[n - 1] > sum || (sum + a[n - 1]) % 2)
      cout << "T\n";
    else
      cout << "HL\n";
  }
  return 0;
}
