#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000000;
void ov(vector<long long> &v) {
  for (int i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
  return;
}
void iv(vector<long long> &v) {
  for (int i = 0; i < v.size(); i++) {
    cin >> v[i];
  }
  return;
}
void ov(vector<string> &v) {
  for (int i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  cout << "\n";
  return;
}
void ovv(vector<vector<long long> > &v) {
  for (int i = 0; i < v.size(); i++) {
    for (int j = 0; j < v[i].size(); j++) {
      cout << v[i][j] << " ";
    }
    cout << "\n";
  }
  return;
}
void ovv(vector<vector<string> > &v) {
  for (int i = 0; i < v.size(); i++) {
    for (int j = 0; j < v[i].size(); j++) {
      cout << v[i][j] << " ";
    }
    cout << "\n";
  }
  return;
}
long long pow(long long a, int n) {
  long long res = 1;
  while (n)
    if (!(n % 2)) {
      n /= 2;
      a *= a;
    } else {
      n--;
      res *= a;
    }
  return res;
}
int l_b(vector<long long> &a, int k) {
  int l = 0, r = a.size() - 1, m;
  if (a[l] == k) return l;
  if (a[r] < k) return -1;
  while (r - l > 1) {
    m = (r + l) / 2;
    if (a[m] >= k)
      r = m;
    else
      l = m;
  }
  return r;
}
int u_b(vector<long long> &a, int k) {
  int l = 0, r = a.size() - 1, m;
  if (a[l] > k) return l;
  if (a[r] <= k) return -1;
  while (r - l > 1) {
    m = (r + l) / 2;
    if (a[m] > k)
      r = m;
    else
      l = m;
  }
  return r;
}
int main() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    bool x;
    cin >> x;
    if (x == 1) {
      cout << "HARD";
      return 0;
    }
  }
  cout << "EASY";
  return 0;
}
