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: 1712kB
Author: 2018212212175
In contest: 1261

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn=10010;
int main()
{
	int n,m;
	int l;
	int a[maxn];
	while(scanf("%d",&n)!=EOF)
	{
	    l=0;
     	for(int i=1;i<=n;i++)
	    {
		     scanf("%d",&a[i]);
	    }
	    for(int i=1;i<=n;i++)
	    {
		   if(a[i]!=1)
		    {
			    m=i;
			    break;
		    }
	    }
	    //for(int i=1;i<n;i++)
	    //{
		   //if(a[i]!=1)
		   // {
			   // l++;
		    //}
	    //}
	    if(m%2==1)
	    {
	    	printf("H\n");
		}
		else
		{
			printf("L\n");
		}   
    }
    return 0;
}