#include <bits/stdc++.h>
using namespace std;
const long long M = 1e9 + 7;
template <typename T>
using minpq = priority_queue<T, vector<T>, greater<T>>;
const long long N = 1e6 + 10;
void solve() {
  long long n;
  cin >> n;
  long long a[n];
  for (auto &e : a) cin >> e;
  long long maxi = *max_element(a, a + n);
  long long sum = accumulate(a, a + n, 0);
  if (maxi > sum - maxi || sum % 2 == 1)
    cout << "T\n";
  else
    cout << "HL\n";
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long te = 1;
  cin >> te;
  while (te--) solve();
  return 0;
}
