#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int t, mod = (1e+9) + 7;
  cin >> t;
  while (t != 0) {
    int n, i;
    cin >> n;
    map<pair<int, int>, int> m;
    for (i = 0; i < n; i++) {
      int a;
      cin >> a;
      m[{a, i}]++;
    }
    int k = 0, sz = n;
    int prev = -1;
    while (sz != 1) {
      int key = (m.rbegin()->first).first, ind = (m.rbegin()->first).second;
      if (ind != prev) {
        prev = ind;
        m.erase({key, ind});
        key -= 1;
        if (key != 0)
          m[{key, ind}]++;
        else
          sz--;
      } else {
        auto it = m.rbegin();
        it--;
        key = (it->first).first, ind = (it->first).second;
        prev = ind;
        m.erase({key, ind});
        key -= 1;
        if (key != 0)
          m[{key, ind}]++;
        else
          sz--;
      }
      k++;
    }
    if (k % 2 == 0)
      cout << "T" << endl;
    else
      cout << "HL" << endl;
    t--;
  }
}
