#include <bits/stdc++.h>
using namespace std;
unordered_map<int, unordered_map<int, int>> gr;
bool dfs(vector<bool>& v, int vd, int pa) {
  v[vd] = true;
  int c = 0;
  for (auto i : gr[vd]) {
    if (!v[i.first]) {
      if (dfs(v, i.first, vd)) {
        cout << i.first << " " << vd;
        return true;
      }
    } else if (i.first != vd)
      return true;
  }
  return false;
}
long long ma(long long arr[], long long n) {
  int ind = 0;
  int i = 31;
  long long ans = 0;
  while (i >= 0) {
    int mI = ind;
    int mE = INT_MIN;
    int k = ind;
    while (k++ < n) {
      if ((arr[k] & (1 << i)) != 0 && arr[k] > mE) {
        mE = arr[k];
        mI = k;
      }
    }
    if (mE == INT_MIN) continue;
    long long temp = arr[ind];
    arr[ind] = arr[mI];
    arr[mI] = temp;
    mI = ind;
    for (int j = 0; j < n; j++) {
      if (j != mI && (arr[j] & (1 << i)) != 0) arr[j] = arr[j] ^ arr[mI];
    }
    i--;
    ind++;
  }
  for (int k = 0; k < n; k++) ans ^= arr[k];
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int a[n];
    long long sum = 0;
    long long ma = LONG_MIN;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
      if (a[i] > ma) ma = a[i];
      sum += a[i];
    }
    if (n == 1) {
      cout << "T\n";
      continue;
    }
    if (ma > sum - ma) {
      cout << "T\n";
      continue;
    }
    if (sum % 2 == 0) {
      cout << "HL\n";
    } else {
      cout << "T\n";
    }
  }
  return 0;
}
