#include <bits/stdc++.h>   using namespace std;   void solve() {     int n;     cin >> n;     vector<pair<long long, long long> > v(n);     for (int i = 0; i < n; i++) {       int a;       cin >> a;       v[i] = {a, 0};     }     if (n == 1) {       cout <<  T n ;       return;     }     while (1) {       sort(v.begin(), v.end(), greater<pair<long long, long long> >());       int t_idx = 0, hl_idx = 0;       while (t_idx < n && v[t_idx].second == 1) t_idx++;       if (t_idx == n || v[t_idx].first == 0) {         cout <<  HL n ;         return;       }       v[t_idx].first--;       while (hl_idx < n && hl_idx == t_idx) hl_idx++;       if (hl_idx == n || v[hl_idx].first == 0) {         cout <<  T n ;         return;       }       v[hl_idx].first--;       for (int i = 0; i < n; i++) {         if (i == hl_idx)           v[i].second = 1;         else           v[i].second = 0;       }     }   }   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     int t;     cin >> t;     while (t--) solve();     return 0;   }   