#include <bits/stdc++.h>
using namespace std;
int x = 1000001;
bool prime[1000001];
void sev() {
  for (int i = 2; i * i <= x; i++) {
    for (int j = i * 2; j <= x; j += i) {
      prime[j] = true;
    }
  }
}
int main() {
  int n;
  cin >> n;
  bool b = true;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    if (a == 1) {
      b = false;
    }
  }
  cout << ((b) ? "EASY" : "HARD") << endl;
  return 0;
}
