#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int n;
int a[105];
int main() {
  int T;
  cin >> T;
  while (T--) {
    cin >> n;
    int tot = 0;
    for (int i = 1; i <= n; i++) {
      scanf("%d", &a[i]);
      tot += a[i];
    }
    int now = 0;
    int last = 0;
    while (tot--) {
      int _max = 0, p = 0;
      for (int i = 1; i <= n; i++) {
        if (a[i] > _max && i != last) {
          _max = a[i];
          p = i;
        }
      }
      if (p == 0) break;
      a[p]--;
      last = p;
      now = 1 - now;
    }
    if (now == 0)
      printf("HL\n");
    else
      printf("T\n");
  }
  return 0;
}
