#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int n, a[105];
int freq[105];
void solve() {
  cin >> n;
  for (int i = 0; i <= 100; ++i) {
    freq[i] = 0;
  }
  priority_queue<pair<int, int> > pq;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    pq.push({a[i], i});
  }
  int term = 1, lst = 0;
  while (1) {
    if (pq.empty()) break;
    if (pq.size() == 1 && pq.top().second == lst) break;
    auto k = pq.top();
    pq.pop();
    if (k.second == lst) {
      auto k2 = pq.top();
      pq.pop();
      pq.push(k);
      k2.first--;
      lst = k2.second;
      if (k2.first) pq.push(k2);
    } else {
      k.first--;
      lst = k.second;
      if (k.first) pq.push(k);
    }
    term ^= 1;
  }
  cout << (term ? "HL" : "T") << '\n';
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cin >> t;
  while (t--) solve();
}
