#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mod2 = 998244353;
const long long N = 1e5 + 5;
const long long N2 = 1e6 + 5;
long long sum() { return 0; }
template <typename... Args>
long long sum(long long a, Args... args) {
  return a + sum(args...);
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  err(++it, args...);
}
istream &operator>>(istream &in, vector<long long> &v) {
  for (long long i = 0; i < v.size(); i++) in >> v[i];
  return in;
}
ostream &operator<<(ostream &out, vector<long long> &v) {
  for (long long i = 0; i < v.size(); i++) out << v[i] << ' ';
  cout << '\n';
  return out;
}
struct point {
  long long x, y;
};
istream &operator>>(istream &in, point &p) {
  in >> p.x >> p.y;
  return in;
}
point operator+(point &a, point &b) {
  point c;
  c.x = a.x + b.x;
  c.y = a.y + b.y;
  return c;
}
point operator-(point &a, point &b) {
  point c;
  c.x = a.x - b.x;
  c.y = a.y - b.y;
  return c;
}
long long len(point a, point b) {
  return (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y);
}
bool rightTriangle(vector<point> &v) {
  long long a2 = len(v[0], v[1]);
  long long b2 = len(v[1], v[2]);
  long long c2 = len(v[0], v[2]);
  if (a2 == 0 || b2 == 0 || c2 == 0) return false;
  return (a2 + b2 == c2 || a2 + c2 == b2 || b2 + c2 == a2);
}
void solve() {
  vector<point> p(3);
  cin >> p[0] >> p[1] >> p[2];
  if (rightTriangle(p)) {
    cout << "RIGHT";
    return;
  }
  vector<point> v = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
  for (long long i = 0; i < 4; i++) {
    for (long long j = 0; j < 3; j++) {
      p[j] = p[j] + v[i];
      if (rightTriangle(p)) {
        cout << "ALMOST";
        return;
      }
      p[j] = p[j] - v[i];
    }
  }
  cout << "NEITHER";
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  for (long long tc = 1; tc < t + 1; tc++) {
    solve();
  }
}
