CF1030A.In Search of an Easy Problem

When preparing a tournament, Codeforces coordinators try treir best to make the first problem as easy as possible. This time the coordinator had chosen some problem and asked $n$ people about their opinions. Each person answered whether this problem is easy or hard.

If at least one of these $n$ people has answered that the problem is hard, the coordinator decides to change the problem. For the given responses, check if the problem is easy enough.

在筹备一场编程竞赛时，Codeforces 的协调员会尽力使第一道题尽可能简单。本次协调员选定了一道题目，并向 $n$ 个人征询了他们的意见。每个人回答了该题是“简单”还是“困难”。

如果这 $n$ 个人中至少有一人认为该题是“困难”的，则协调员决定更换该题。给定这些人的回答，请判断该题是否足够简单。

The first line contains a single integer $n$ ($1 \le n \le 100$) — the number of people who were asked to give their opinions.

The second line contains $n$ integers, each integer is either $0$ or $1$. If $i$-th integer is $0$, then $i$-th person thinks that the problem is easy; if it is $1$, then $i$-th person thinks that the problem is hard.

第一行包含一个整数 $n$（$1 \le n \le 100$）—— 表示被询问意见的人数。

第二行包含 $n$ 个整数，每个整数为 $0$ 或 $1$。若第 $i$ 个整数为 $0$，则表示第 $i$ 个人认为该问题简单；若为 $1$，则表示第 $i$ 个人认为该问题困难。

Print one word: "EASY" if the problem is easy according to all responses, or "HARD" if there is at least one person who thinks the problem is hard.

You may print every letter in any register: "EASY", "easy", "EaSY" and "eAsY" all will be processed correctly.

如果根据所有人的回答，该问题都很容易，则输出一个单词：“EASY”；如果至少有一人认为该问题很难，则输出“HARD”。

您可以以任意大小写形式输出每个字母：“EASY”、“easy”、“EaSY” 和 “eAsY” 均会被正确判别。

In the first example the third person says it's a hard problem, so it should be replaced.

In the second example the problem easy for the only person, so it doesn't have to be replaced.

在第一个例子中，第三人称说这是一个难题，因此应当将其替换。

在第二个例子中，该问题对唯一一人来说是简单的，因此无需替换。