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: 1812kB
Author: 2018212212131
In contest: 1261

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<set>
#include<vector>
#include<string>
#include<cstring>
using namespace std;
const int inf=0x3f3f3f3f;
const int maxn=13000;
long long num[maxn];
int main(){
	int n;
	while(~scanf("%d",&n)){
		int cnt=0;
		for(int i=1;i<=n;i++){
			scanf("%lld",&num[i]);
		}
		if(num[1]==1)
		for(int i=1;i<=n;i++){
			if(num[i]==1) cnt++;
			else break;
		}
		if(num[1]==1&&n>1&&cnt%2!=0){
			printf("L\n");
		}
		else printf("H\n");
	}
	return 0;
}