#include <bits/stdc++.h>
using namespace std;
bool can(vector<int> v, int last) {
  for (int i = 0; i < v.size(); i++) {
    if (v[i] > 0 && i != last) {
      return true;
    }
  }
  return false;
}
int maxi(vector<int> v, int last) {
  int m = 0;
  int j;
  for (int i = 0; i < v.size(); i++) {
    if (i != last && v[i] > m) {
      m = v[i];
      j = i;
    }
  }
  return j;
}
int main() {
  int n;
  cin >> n;
  while (n > 0) {
    int t;
    cin >> t;
    vector<int> v;
    for (int i = 0; i < t; i++) {
      int k;
      cin >> k;
      v.push_back(k);
    }
    sort(v.begin(), v.end());
    int last = -1;
    int play = 1;
    while (can(v, last)) {
      int h = maxi(v, last);
      last = h;
      v[h]--;
      play = 1 - play;
    }
    if (play == 1) {
      cout << "HL" << endl;
    } else {
      cout << "T" << endl;
    }
    n--;
  }
  return 0;
}
