#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 10;
const ll inf = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1e9 + 7;
const ll q = 1e17;

/*
int n;
ll a[maxn];

int main()
{
	scanf("%d", &n);
	ll l = 0, r = q;
	for(int i = 1; i <= n; i++)
		scanf("%lld", &a[i]);
	if(n % 2)
	{

	}
	return 0;
}*/


int n;
ll sum[1001];

int main()
{
	while(scanf("%d", &n) != EOF)
	{
		int flag = 1;
		ll ans = 0;
		for(int i = 1; i <= n; i++)
		{
			scanf("%lld", &sum[i]);
			if(sum[i] == 0)
				continue;
			if(flag)
			{
				if(sum[i] == 1)
					ans++;
				else 
					flag = 0;
			}
		}
		if(flag != 1)
		{
			if(ans % 2)
				cout << "L" << endl;
			else 
				cout << "H" << endl;
		}
		else 
		{
			if(ans % 2)
				cout << "H" << endl;
			else 
				cout << "L" << endl;
		}
	}
	return 0;
}