#include<iostream>
#include<algorithm>
using namespace std;
int  ju1(int a[3]){
	if(a[0]+a[1]<=a[2])return 0;
	if(a[0]*a[0]+a[1]*a[1]==a[2]*a[2])return 1; 
	if(a[0]*a[0]+a[1]*a[1]>a[2]*a[2])return 2;
	if(a[0]*a[0]+a[1]*a[1]<a[2]*a[2])return 3; 
}
int ju2(int a[3]){
	if(a[0]==a[1]&&a[1]==a[2])return 4;
	if(a[0]==a[1]||a[0]==a[2]||a[2]==a[1])return 5; 
}
int main(){
	int a[3];
	for(int i=0;i<3;i++)cin>>a[i];
	sort(a,a+3);
	switch(ju1(a)){
		case 0:cout<<"Not triangle";
				return 0;
		case 1:cout<<"Right triangle";
				break;
		case 2:cout<<"Acute triangle";
				break;
		case 3:cout<<"Obtuse triangle";
				break;
	}
	cout<<endl;
	switch(ju2(a)){
		case 4:cout<<"Equilateral triangle";
				break;
		case 5:cout<<"Isosceles triangle";
				break;
	}
}
//拜托大佬们看一下哪里出错了QAQ