#include <bits/stdc++.h>
using namespace std;
int x[3], y[3];
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, -1, 1};
int sq(int x) { return x * x; }
bool check() {
  vector<int> len;
  len.push_back(sq(x[0] - x[1]) + sq(y[0] - y[1]));
  len.push_back(sq(x[1] - x[2]) + sq(y[1] - y[2]));
  len.push_back(sq(x[0] - x[2]) + sq(y[0] - y[2]));
  sort(len.begin(), len.end());
  if (len[0] == 0) return false;
  if (len[0] + len[1] == len[2]) return true;
  return false;
}
int main() {
  for (int i = 0; i < 3; ++i) cin >> x[i] >> y[i];
  if (check()) {
    cout << "RIGHT" << endl;
    exit(0);
  }
  for (int i = 0; i < 3; ++i)
    for (int j = 0; j < 4; ++j) {
      x[i] += dx[j];
      y[i] += dy[j];
      if (check()) {
        cout << "ALMOST" << endl;
        exit(0);
      }
      x[i] -= dx[j];
      y[i] -= dy[j];
    }
  cout << "NEITHER" << endl;
  return 0;
}
