#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int z[4][2] = {1, 0, -1, 0, 0, 1, 0, -1};
int k(int x1, int y1, int x2, int y2) {
  int c = (x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2);
  return c;
}
int w(int a, int b, int c, int d, int e, int f) {
  int q, qq, qqq;
  q = k(a, b, c, d);
  qq = k(a, b, e, f);
  qqq = k(c, d, e, f);
  if (q > qqq) {
    int x = q;
    q = qqq;
    qqq = x;
  };
  if (qq > qqq) {
    int x = qq;
    qq = qqq;
    qqq = x;
  };
  if (q > qq) {
    int x = q;
    q = qq;
    qq = x;
  };
  double r;
  double a1, b1, c1;
  a1 = sqrt(q);
  b1 = sqrt(qq);
  c1 = sqrt(qqq);
  r = (c1 + b1 + a1) * (c1 + a1 - b1) * (b1 + c1 - a1) * (b1 - c1 + a1);
  if ((q + qq == qqq) && (r > 0.000001 || r < -0.000001))
    return 1;
  else
    return 0;
}
int main() {
  int a, b, c, d, e, f;
  scanf("%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f);
  if (w(a, b, c, d, e, f)) {
    printf("RIGHT\n");
    return 0;
  }
  int g = 0;
  int k, kk;
  for (int i = 0; i < 4; i++) {
    k = a + z[i][0], kk = b + z[i][1];
    if (w(k, kk, c, d, e, f)) g = 1;
  }
  for (int i = 0; i < 4; i++) {
    k = c + z[i][0], kk = d + z[i][1];
    if (w(a, b, k, kk, e, f)) g = 1;
  }
  for (int i = 0; i < 4; i++) {
    k = e + z[i][0], kk = f + z[i][1];
    if (w(a, b, c, d, k, kk)) g = 1;
  }
  if (g)
    printf("ALMOST\n");
  else
    printf("NEITHER\n");
}
