#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const long long LINF = INF * (long long)INF;
const int MAX = 1000 + 47;
vector<pair<int, int> > A(3);
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
bool isRight(vector<pair<int, int> > A) {
  for (int k = (0); k < (3); k++) {
    int x1 = A[k].first;
    int y1 = A[k].second;
    int x2 = A[k + 1].first;
    int y2 = A[k + 1].second;
    int x3 = A[k + 2].first;
    int y3 = A[k + 2].second;
    if ((x2 - x1) * (x3 - x1) + (y2 - y1) * (y3 - y1) == 0) {
      return true;
    }
    A.push_back(A[k]);
  }
  return false;
}
bool isOk(vector<pair<int, int> > A) {
  int k = 0;
  int x1 = A[k].first;
  int y1 = A[k].second;
  int x2 = A[k + 1].first;
  int y2 = A[k + 1].second;
  int x3 = A[k + 2].first;
  int y3 = A[k + 2].second;
  return (x2 - x1) * (y3 - y1) - (x3 - x1) * (y2 - y1) != 0;
}
int main() {
  for (int i = (0); i < (3); i++) {
    cin >> A[i].first >> A[i].second;
  }
  if (isRight(A)) {
    cout << "RIGHT" << endl;
    return 0;
  }
  for (int i = (0); i < (3); i++) {
    for (int k = (0); k < (4); k++) {
      A[i].first += dx[k];
      A[i].second += dy[k];
      if (isOk(A) && isRight(A)) {
        cout << "ALMOST" << endl;
        return 0;
      }
      A[i].first -= dx[k];
      A[i].second -= dy[k];
    }
  }
  cout << "NEITHER" << endl;
}
