#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 6;
int n, m, a[N];
int main() {
  int x[3], y[3];
  cin >> x[0] >> y[0] >> x[1] >> y[1] >> x[2] >> y[2];
  int len[3] = {(x[1] - x[0]) * (x[1] - x[0]) + (y[1] - y[0]) * (y[1] - y[0]),
                (x[2] - x[0]) * (x[2] - x[0]) + (y[2] - y[0]) * (y[2] - y[0]),
                (x[1] - x[2]) * (x[1] - x[2]) + (y[1] - y[2]) * (y[1] - y[2])};
  int ff = 0;
  int z[] = {len[0], len[1], len[2]};
  sort(z, z + 3);
  if (z[0] + z[1] == z[2])
    puts("RIGHT");
  else {
    for (int i = 0; i < 3 && !ff; i++) {
      for (int j = 0; j < 4 && !ff; j++) {
        if (j == 0) {
          x[i] += 1;
          len[0] =
              (x[1] - x[0]) * (x[1] - x[0]) + (y[1] - y[0]) * (y[1] - y[0]);
          len[1] =
              (x[2] - x[0]) * (x[2] - x[0]) + (y[2] - y[0]) * (y[2] - y[0]);
          len[2] =
              (x[1] - x[2]) * (x[1] - x[2]) + (y[1] - y[2]) * (y[1] - y[2]);
          sort(len, len + 3);
          if (!len[0]) {
            x[i] -= 1;
            continue;
          }
          if (x[0] == x[1] && x[1] == x[2] || y[1] == y[0] && y[1] == y[2]) {
            x[i] -= 1;
            continue;
          }
          if (len[0] + len[1] == len[2]) {
            puts("ALMOST");
            ff = 1;
          }
          x[i] -= 1;
        } else if (j == 1) {
          x[i] -= 1;
          len[0] =
              (x[1] - x[0]) * (x[1] - x[0]) + (y[1] - y[0]) * (y[1] - y[0]);
          len[1] =
              (x[2] - x[0]) * (x[2] - x[0]) + (y[2] - y[0]) * (y[2] - y[0]);
          len[2] =
              (x[1] - x[2]) * (x[1] - x[2]) + (y[1] - y[2]) * (y[1] - y[2]);
          sort(len, len + 3);
          if (!len[0]) {
            x[i] += 1;
            continue;
          }
          if (x[0] == x[1] && x[1] == x[2] || y[1] == y[0] && y[1] == y[2]) {
            x[i] += 1;
            continue;
          }
          if (len[0] + len[1] == len[2]) {
            puts("ALMOST");
            ff = 1;
          }
          x[i] += 1;
        } else if (j == 2) {
          y[i] -= 1;
          len[0] =
              (x[1] - x[0]) * (x[1] - x[0]) + (y[1] - y[0]) * (y[1] - y[0]);
          len[1] =
              (x[2] - x[0]) * (x[2] - x[0]) + (y[2] - y[0]) * (y[2] - y[0]);
          len[2] =
              (x[1] - x[2]) * (x[1] - x[2]) + (y[1] - y[2]) * (y[1] - y[2]);
          sort(len, len + 3);
          if (!len[0]) {
            y[i] += 1;
            continue;
          }
          if (x[0] == x[1] && x[1] == x[2] || y[1] == y[0] && y[1] == y[2]) {
            y[i] += 1;
            continue;
          }
          if (len[0] + len[1] == len[2]) {
            puts("ALMOST");
            ff = 1;
          }
          y[i] += 1;
        } else if (j == 3) {
          y[i] += 1;
          len[0] =
              (x[1] - x[0]) * (x[1] - x[0]) + (y[1] - y[0]) * (y[1] - y[0]);
          len[1] =
              (x[2] - x[0]) * (x[2] - x[0]) + (y[2] - y[0]) * (y[2] - y[0]);
          len[2] =
              (x[1] - x[2]) * (x[1] - x[2]) + (y[1] - y[2]) * (y[1] - y[2]);
          sort(len, len + 3);
          if (!len[0]) {
            y[i] -= 1;
            continue;
          }
          if (x[0] == x[1] && x[1] == x[2] || y[1] == y[0] && y[1] == y[2]) {
            y[i] -= 1;
            continue;
          }
          if (len[0] + len[1] == len[2]) {
            puts("ALMOST");
            ff = 1;
          }
          y[i] -= 1;
        }
      }
    }
    if (!ff) puts("NEITHER");
  }
  return 0;
}
