#include <bits/stdc++.h>
using namespace std;
void dout() { cerr << endl; }
template <typename Head, typename... Tail>
void dout(Head H, Tail... T) {
  cerr << H << ' ';
  dout(T...);
}
using ll = long long;
using pii = pair<ll, ll>;
using ld = long double;
using pll = pair<long long, long long>;
template <typename T>
void do_uniq(vector<T> vec) {
  sort((vec).begin(), (vec).end());
  vec.resize(unique((vec).begin(), (vec).end()) - vec.begin());
}
clock_t timestamp_start = clock();
void time_calc() {
  cerr << (ld)(clock() - timestamp_start) / CLOCKS_PER_SEC << "\n";
}
void precalc() {}
using ll = long long;
using ld = long double;
inline ll add(ll a, ll b, ll mod) {
  int val = a + b;
  if (val > mod) return val - mod;
  return val;
}
inline ll sub(ll a, ll b, ll mod) { return add(a, mod - b, mod); }
inline ll mult(ll a, ll b, ll mod) { return (a * 1ll * b) % mod; }
const int MAXN = 2e5 + 120;
void solve() {
  int n;
  cin >> n;
  vector<int> v;
  int sum = 0;
  for (int i = 0; i < n; ++i) {
    int curr;
    cin >> curr;
    v.push_back(curr);
    sum += curr;
  }
  if (n == 1) {
    cout << "T\n";
    return;
  }
  if (sum % 2 == 1) {
    cout << "T\n";
  } else {
    for (int i = 0; i < n; ++i) {
      if (sum - v[i] < v[i]) {
        cout << "T\n";
        return;
      }
    }
    cout << "HL\n";
  }
}
void multisolve() {
  int t;
  cin >> t;
  int i = 1;
  while (t--) {
    solve();
    i++;
  }
}
void gen() {
  for (int i = 1; i <= 1427; ++i) {
    cout << i << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr), cout.tie(nullptr);
  cout << fixed << setprecision(4);
  multisolve();
  time_calc();
}
