#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 100;
long long int a[N], las = -1;
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    bool tu = 0;
    las = -1;
    while (1) {
      int les = max_element(a, a + n) - a;
      if (a[les] == 0) break;
      if (las == les) {
        int car = a[les];
        a[les] = 0;
        int les2 = max_element(a, a + n) - a;
        a[les] = car;
        if (les == les2) break;
        les = les2;
      }
      if (a[les] == 0) break;
      a[les]--;
      tu ^= 1;
      las = les;
    }
    cout << ((tu) ? "T" : "HL") << '\n';
  }
}
