#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn=1005;
int f[maxn];
int main(){
	int n;
	while(~scanf("%d",&n)){
		int k=0,l=0,flag=1;
		for(int i=1;i<=n;i++) {
			scanf("%d",&f[i]);
		}
		if(f[1]==1){
			k++;
			for(int j=2;j<n;j++){
				if(f[j]==1) k++;
				else break;
			}
		}
		if(k%2==0) printf("H\n");
		else printf("L\n");
	}
}