#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
int main() {

	int x[3];
	while (cin >> x[0]>>x[1]>>x[2]) {
		//判断大小
		sort(x, x + 3);
		int m = x[0] * x[0] + x[1] * x[1];
		int n = x[2] * x[2];
		if (m == n) {
			printf("直角三角形\n");
		}
		else if (m > n) {
			printf("锐角三角形\n");
		}
		else if (m < n) {
			printf("钝角三角形\n");
		}
	}

	return 0;
}