#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
void solve() {
  long long int n;
  cin >> n;
  vector<long long int> a(n);
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long int mx = *max_element((a).begin(), (a).end());
  long long int sum = accumulate((a).begin(), (a).end(), 0LL);
  if (mx > sum - mx || sum % 2 == 1) {
    cout << "T" << '\n';
  } else {
    cout << "HL" << '\n';
  }
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long int T;
  cin >> T;
  for (long long int TT = 1; TT <= T; TT++) {
    solve();
  }
  cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
  return 0;
}
