#include <bits/stdc++.h>
using namespace std;
void setIO(string s = "") {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin.exceptions(cin.failbit);
  if (s.size()) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
  }
}
long long int isRight(long long int a[], long long int b[]) {
  long long int d[3];
  d[0] = (a[0] - a[1]) * (a[0] - a[1]) + (b[0] - b[1]) * (b[0] - b[1]);
  d[1] = (a[2] - a[1]) * (a[2] - a[1]) + (b[2] - b[1]) * (b[2] - b[1]);
  d[2] = (a[0] - a[2]) * (a[0] - a[2]) + (b[0] - b[2]) * (b[0] - b[2]);
  sort(d, d + 3);
  if (d[0] + d[1] == d[2] && d[2] != 0 && d[0] != 0) return 1;
  return 0;
}
void solve() {
  long long int n, m, j, k, l, i;
  long long int a[3];
  long long int b[3];
  vector<pair<long long int, long long int>> v;
  for (long long int i = 0; i < 3; i++) {
    cin >> a[i] >> b[i];
    v.push_back(make_pair(a[i], b[i]));
  }
  if (isRight(a, b) == 1) {
    cout << "RIGHT";
    cout << "\n";
    return;
  }
  a[0]++;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  a[0]--;
  a[0]--;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  a[0]++;
  a[0]++;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  a[0]--;
  a[0]--;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  a[0]++;
  a[1]++;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  a[1]--;
  a[1]--;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  a[1]++;
  a[2]++;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  a[2]--;
  a[2]--;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  a[2]++;
  b[0]++;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  b[0]--;
  b[0]--;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  b[0]++;
  b[0]++;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  b[0]--;
  b[0]--;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  b[0]++;
  b[1]++;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  b[1]--;
  b[1]--;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  b[1]++;
  b[2]++;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  b[2]--;
  b[2]--;
  if (isRight(a, b) == 1) {
    cout << "ALMOST";
    cout << "\n";
    return;
  }
  b[2]++;
  cout << "NEITHER";
  cout << "\n";
  return;
}
int main() {
  setIO();
  long long int totalTestCase = 1;
  for (long long int testCase = 1; testCase <= totalTestCase; testCase++) {
    solve();
  }
  return 0;
}
