func_code_string: #include <bits/stdc++.h>   using namespace std;   string FILE_NAME =  testcase.A ;   string NAME;   string itos(int n) {     stringstream ss;     ss << n;     return ss.str();   }   const int dx[] = {0, 1, 0, -1};   const int dy[] = {-1, 0, 1, 0};   bool is_right(vector<pair<int, int> > p) {     vector<int> len2(3, 0);     for (int i = 0; i < (3); i++) {       int x0 = p[i].first, y0 = p[i].second;       int x1 = p[(i + 1) % 3].first, y1 = p[(i + 1) % 3].second;       len2[i] = (x0 - x1) * (x0 - x1) + (y0 - y1) * (y0 - y1);     }     sort(len2.begin(), len2.end());     return ((len2[2] == len2[0] + len2[1]) &&             (sqrt(len2[2]) + 1e-8 < sqrt(len2[0]) + sqrt(len2[1])));   }   bool search_right_triangle(vector<pair<int, int> > p) {     for (int i = 0; i < (3); i++) {       for (int k = 0; k < (4); k++) {         vector<pair<int, int> > q = p;         q[i].first += dx[k];         q[i].second += dy[k];         if (is_right(q)) return true;       }     }     return false;   }   int main() {     vector<pair<int, int> > p(3);     for (int i = 0; i < (3); i++) {       cin >> p[i].first >> p[i].second;     }     if (is_right(p)) {       cout <<  RIGHT  << endl;     } else if (search_right_triangle(p)) {       cout <<  ALMOST  << endl;     } else {       cout <<  NEITHER  << endl;     }     return 0;   }   