#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<map>
using namespace std;
typedef long long LL;
const LL mod = 1e9+7;
const int MAXN = 1e6+5;
int n;
int a[1005];
int main()
{
	while(~scanf("%d", &n))
	{
		int cnt = 0;
		for(int i =1;i<=n;i++)
		{
			scanf("%d",&a[i]);
		}
		if(a[1] == 1)
		{
			cnt = 1;
			for(int i =2;i<=n-1;i++)
			{
				if(a[i] == 1)cnt++;
				else break;
			}
		}
		if(cnt%2 == 1)printf("L\n");
		else printf("H\n");
	}
	return 0;
}