#include <bits/stdc++.h>
using namespace std;
struct ponto {
  int x, y;
} p[3];
int d[3];
int dist(ponto a, ponto b) {
  return ((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
bool testa(ponto a, ponto b, ponto c) {
  if ((a.x == b.x && a.y == b.y) || (a.x == c.x && a.y == c.y) ||
      (b.x == c.x && b.y == c.y))
    return false;
  d[0] = dist(a, b);
  d[1] = dist(b, c);
  d[2] = dist(a, c);
  sort(d, d + 3);
  return (d[0] + d[1] == d[2]);
}
int main() {
  scanf("%d %d %d %d %d %d", &p[0].x, &p[0].y, &p[1].x, &p[1].y, &p[2].x,
        &p[2].y);
  if (testa(p[0], p[1], p[2])) {
    printf("RIGHT\n");
    return 0;
  } else {
    bool flag = false;
    for (int i = 0; i < 3; i++) {
      p[i].x -= 1;
      if (testa(p[0], p[1], p[2])) flag = true;
      p[i].x += 2;
      if (testa(p[0], p[1], p[2])) flag = true;
      p[i].x -= 1;
      p[i].y -= 1;
      if (testa(p[0], p[1], p[2])) flag = true;
      p[i].y += 2;
      if (testa(p[0], p[1], p[2])) flag = true;
      p[i].y -= 1;
    }
    if (flag)
      printf("ALMOST\n");
    else
      printf("NEITHER\n");
  }
  return 0;
}
