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: 1100kB
Author: 2018212212161
In contest: 1261

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
const int maxn=1010;
long long a[maxn];
int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		int f=1;
		memset(a,0,sizeof(a));
		for(int i=1;i<=n;i++)
		{
			scanf("%lld",&a[i]);
		}
		for(int i=1;i<n;i++)
		{
			if(a[i]==1)	f=-f;
			else break;
		}
		if(f==-1)	printf("L\n");
		else	printf("H\n");
	}
}