#include <bits/stdc++.h>
using namespace std;
void dfs(int n) {}
int main() {
  int n;
  cin >> n;
  int a[n];
  bool flag = 0;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    if (a[i] == 1) {
      flag = 1;
    }
  }
  if (flag) {
    cout << "Hard" << endl;
  } else
    cout << "Easy" << endl;
}
