#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
using namespace std;
const int inf = 0x3f3f3f3f;
#define LL long long int
long long  gcd(long long  a, long long  b) { return a == 0 ? b : gcd(b % a, a); }


int T;
int main()
{
	
		int n;
		while(scanf("%d",&n)!=EOF)
		{
			int tag=1;
			bool can=true;
			for(int i=1;i<=n;i++)
			{
				int x;
				scanf("%d",&x);
				if(!can)continue;
				if(x==1)tag^=1;
				else can=false;
			}
			if(tag)printf("H\n");
			else printf("L\n");
		}
		

}