Start: Feb, 21, 2019 12:00:00
2018-2019 ACM集训队冬季集训第二次考核
End: Feb, 21, 2019 17:00:00
Time elapsed:
Time remaining:

Problem_ID: I
Result: Accepted
Time: 6ms
Memory: 1716kB
Author: 2017212212283
In contest: 1261

#include <cstdio>
#include <iostream>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <stack>

#define MAXN 1005
using namespace std;
typedef long long ll;

int n,a[MAXN];

void by()
{
	int x=0;
	char fir='H',sec='L';
	
	for(int i=0;i<n;i++)
	{
		if(i==n-1)
		{
			printf("%c\n",fir);
			break;
		}
		
		if(a[i]==1)
			swap(fir,sec);	
		else
		{
			printf("%c\n",fir);
			break;
		}
	}
	
}

int main()
{
	while(scanf("%d",&n)!=EOF)
	{
		for(int i=0;i<n;i++)
			scanf("%d",&a[i]);
		
		by();
	}
	return 0;
}