#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <iostream>
#define H true;
#define L false;
using namespace std;
const int maxn=1010;
int bi[maxn];
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		bool now=H;
		for(int i=1;i<=n;++i)
		{
			scanf("%d",bi+i);
		}
		for(int i=1;i<=n;++i)
		{
			if(bi[i]==1)now=!now;
			else break;
		}
		if(now)printf("H\n");
		else printf("L\n");
	}
}