#include <bits/stdc++.h>
using namespace std;
int main() {
  {
    vector<pair<int, int> > v(3), vp;
    for (int i = 0; i < 3; i++) cin >> v[i].first >> v[i].second;
    vector<bool> vb(2, 0);
    for (int i = 0; i < 13; i++) {
      vp = v;
      vector<bool> vg(3, 0);
      int s1, s2, s3;
      long double area;
      if (i != 0)
        if (i < 7)
          if (i < 4)
            vp[i - 1].first--;
          else
            vp[i - 4].second--;
        else if (i < 10)
          vp[i - 7].first++;
        else
          vp[i - 10].second++;
      s1 = (vp[0].first - vp[1].first) * (vp[0].first - vp[1].first) +
           (vp[0].second - vp[1].second) * (vp[0].second - vp[1].second);
      s2 = (vp[1].first - vp[2].first) * (vp[1].first - vp[2].first) +
           (vp[1].second - vp[2].second) * (vp[1].second - vp[2].second);
      s3 = (vp[2].first - vp[0].first) * (vp[2].first - vp[0].first) +
           (vp[2].second - vp[0].second) * (vp[2].second - vp[0].second);
      int m = max(s1, max(s2, s3));
      double ss1 = pow(s1, 0.5);
      double ss2 = pow(s2, 0.5);
      double ss3 = pow(s3, 0.5);
      area = 0.25 * pow((ss1 + ss2 + s3) * (-ss1 + ss2 + ss3), 0.5) *
             pow((ss1 - ss2 + s3) * (ss1 + ss2 - ss3), 0.5);
      if (area > 0 && i == 0 && (m == s1 + s2 + s3 - m)) {
        vb[0] = 1;
        break;
      }
      if (area > 0 && (m == s1 + s2 + s3 - m)) {
        vb[1] = 1;
        break;
      }
    }
    if (vb[0])
      cout << "RIGHT";
    else if (vb[1])
      cout << "ALMOST";
    else
      cout << "NEITHER";
  }
  return 0;
}
