#include <bits/stdc++.h>
using namespace std;
int x[3], y[3], dir[][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
double dis(int i, int j) {
  return sqrt(1.0 * (x[i] - x[j]) * (x[i] - x[j]) +
              1.0 * (y[i] - y[j]) * (y[i] - y[j]));
}
int ss(int i, int j) {
  return (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
}
bool solve() {
  double a = dis(0, 1), b = dis(0, 2), c = dis(1, 2);
  int aa = ss(0, 1), bb = ss(0, 2), cc = ss(1, 2);
  return ((a + b > c && b + c > a && a + c > b) &&
          (aa + bb == cc || aa + cc == bb || bb + cc == aa));
}
int main() {
  for (int i = 0; i < 3; i++) scanf("%d%d", &x[i], &y[i]);
  if (solve())
    puts("RIGHT");
  else {
    bool f = false;
    for (int i = 0; i < 3; i++) {
      if (f) break;
      for (int j = 0; j < 4; j++) {
        x[i] += dir[j][0], y[i] += dir[j][1];
        if (solve()) {
          f = true;
          break;
        }
        x[i] -= dir[j][0], y[i] -= dir[j][1];
      }
    }
    if (f)
      puts("ALMOST");
    else
      puts("NEITHER");
  }
  return 0;
}
