In Search of an Easy Problem

Source: Codeforces

Version: Phuoc Hung OJ Extended

Problem Statement

Given n opinions (0=easy,1=hard), print HARD if at least one opinion is 1, otherwise EASY; read all n values.

Input

n in [1,100], followed by n integers 0 or 1.

Output

Exactly EASY or HARD.

Subtasks

• Subtask 1 (20%): $n\le5$.
• Subtask 2 (30%): $n\le25$.
• Subtask 3 (50%): $n\le100$.

Examples

Example 1

Input

3
0 0 1

Output

HARD

Explanation

The third person votes 1, so the result is HARD.

Example 2

Input

1
0

Output

EASY

Explanation

Every opinion is 0.