#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
#include <time.h>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <unordered_map>
using namespace std;

int main() {
    int a(0), b(0), c(0);
    while (cin >> a >> b >> c) {
        int big = max(a, max(b, c));
        int small = min(a, min(b, c));
        int middle = a + b + c - big - small;
        if (pow(big, 2) == pow(small, 2) + pow(middle, 2)) {
            cout << "直角三角形" << endl;
        } else if (pow(big, 2) > pow(small, 2) + pow(middle, 2)) {
            cout << "钝角三角形" << endl;
        } else {
            cout << "锐角三角形" << endl;
        }
    }
    return 0;
}