#include <bits/stdc++.h>
using namespace std;
bool sortf(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first > b.first;
}
int f(int x1, int x2, int x3, int x4, int x5, int x6) {
  int d = 0;
  int l = pow(abs(x1 - x3), 2) + pow(abs(x2 - x4), 2);
  int k = pow(abs(x5 - x3), 2) + pow(abs(x6 - x4), 2);
  int m = pow(abs(x1 - x5), 2) + pow(abs(x2 - x6), 2);
  if ((l + k == m) || (l + m == k) || (m + k == l)) d = 1;
  return d;
}
int main() {
  long long int r, e, t, y, z, x, n, i, xx, j, k, l, p, m, h = 0;
  int x1, x2, x3, x4, x5, x6;
  cin >> x1 >> x2 >> x3 >> x4 >> x5 >> x6;
  int h1 = 0, h2 = 0, h3 = 0, h4 = 0, h5 = 0, h6 = 0, h7 = 0, h8 = 0, h9 = 0,
      h10 = 0, h11 = 0;
  h = f(x1, x2, x3, x4, x5, x6);
  set<pair<int, int>> s;
  if (h == 1)
    cout << "RIGHT";
  else {
    s.insert(make_pair(x1 + 1, x2));
    s.insert(make_pair(x3, x4));
    s.insert(make_pair(x5, x6));
    if (s.size() == 3) h = f(x1 + 1, x2, x3, x4, x5, x6);
    s.clear();
    s.insert(make_pair(x1 - 1, x2));
    s.insert(make_pair(x3, x4));
    s.insert(make_pair(x5, x6));
    if (s.size() == 3) h1 = f(x1 - 1, x2, x3, x4, x5, x6);
    s.clear();
    s.insert(make_pair(x1, x2 + 1));
    s.insert(make_pair(x3, x4));
    s.insert(make_pair(x5, x6));
    if (s.size() == 3) h2 = f(x1, x2 + 1, x3, x4, x5, x6);
    s.clear();
    s.insert(make_pair(x1, x2 - 1));
    s.insert(make_pair(x3, x4));
    s.insert(make_pair(x5, x6));
    if (s.size() == 3) h3 = f(x1, x2 - 1, x3, x4, x5, x6);
    s.clear();
    s.insert(make_pair(x1, x2));
    s.insert(make_pair(x3 + 1, x4));
    s.insert(make_pair(x5, x6));
    if (s.size() == 3) h4 = f(x1, x2, x3 + 1, x4, x5, x6);
    s.clear();
    s.insert(make_pair(x1, x2));
    s.insert(make_pair(x3 - 1, x4));
    s.insert(make_pair(x5, x6));
    if (s.size() == 3) h5 = f(x1, x2, x3 - 1, x4, x5, x6);
    s.clear();
    s.insert(make_pair(x1, x2));
    s.insert(make_pair(x3, x4 + 1));
    s.insert(make_pair(x5, x6));
    if (s.size() == 3) h6 = f(x1, x2, x3, x4 + 1, x5, x6);
    s.clear();
    s.insert(make_pair(x1, x2));
    s.insert(make_pair(x3, x4 - 1));
    s.insert(make_pair(x5, x6));
    if (s.size() == 3) h7 = f(x1, x2, x3, x4 - 1, x5, x6);
    s.clear();
    s.insert(make_pair(x1, x2));
    s.insert(make_pair(x3, x4));
    s.insert(make_pair(x5 + 1, x6));
    if (s.size() == 3) h8 = f(x1, x2, x3, x4, x5 + 1, x6);
    s.clear();
    s.insert(make_pair(x1, x2));
    s.insert(make_pair(x3, x4));
    s.insert(make_pair(x5 - 1, x6));
    if (s.size() == 3) h9 = f(x1, x2, x3, x4, x5 - 1, x6);
    s.clear();
    s.insert(make_pair(x1, x2));
    s.insert(make_pair(x3, x4));
    s.insert(make_pair(x5, x6 + 1));
    if (s.size() == 3) h10 = f(x1, x2, x3, x4, x5, x6 + 1);
    s.clear();
    s.insert(make_pair(x1, x2));
    s.insert(make_pair(x3, x4));
    s.insert(make_pair(x5, x6 - 1));
    if (s.size() == 3) h11 = f(x1, x2, x3, x4, x5, x6 - 1);
    if (h == 1 || h1 == 1 || h2 == 1 || h3 == 1 || h4 == 1 || h5 == 1 ||
        h6 == 1 || h6 == 1 || h7 == 1 || h8 == 1 || h9 == 1 || h10 == 1 ||
        h11 == 1)
      cout << "ALMOST";
    else
      cout << "NEITHER";
  }
}
