#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
int gcd(int a, int b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
void read(int arr[], int n) {
  for (int i = 0; i < n; ++i) cin >> arr[i];
}
void printv(vector<int> arr, int n) {
  for (int i = 0; i < n; ++i) cout << arr[i] << " ";
  cout << endl;
}
void print(int arr[], int n) {
  for (int i = 0; i < n; ++i) cout << arr[i] << " ";
  cout << endl;
}
bool isPrime(int n) {
  bool flag = 1;
  for (int i = 2; i <= sqrt(n); ++i) {
    if (n % i == 0) {
      flag = 0;
      break;
    }
  }
  return (flag ? 1 : 0);
}
int power(int x, int y) {
  int res = 1;
  while (y) {
    if (y & 1) res = (res * x) % 1000000007;
    x = (x * x) % 1000000007;
    y >>= 1;
  }
  return res;
}
void test_case() {
  int n;
  scanf("%d", &n);
  vector<int> a(n);
  for (int i = 0; i < n; ++i) {
    scanf("%d", &a[i]);
  }
  sort(a.rbegin(), a.rend());
  int sum = accumulate(a.begin(), a.end(), 0);
  if (a[0] > sum - a[0] || sum % 2 != 0) {
    printf("%s\n", "T");
  } else {
    printf("%s\n", "HL");
  }
}
signed main() {
  int t = 1;
  scanf("%d", &t);
  while (t--) test_case();
  return 0;
}
