#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define endl '\n'
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key
#define all(v) v.begin(), v.end()
#define yes cout << "YES" << endl        
#define no cout << "NO" << endl          
#define M 1000000007                     
#define lcm(a, b) a *b / gcd(a, b)       
#define memz(a) memset(a, 0, sizeof(a))  
#define memn(a) memset(a, -1, sizeof(a)) 
ll dx[]={1,0,-1,0,1,-1,-1,1};
ll dy[]={0,1,0,-1,1,1,-1,-1};

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    ll arr[3];
    for(auto &u:arr)cin>>u;
    sort(arr,arr+3);
    if(arr[0]+arr[1]<=arr[2])cout<<"Not a triangle"<<endl;
    else if(arr[0]==arr[1]&&arr[1]==arr[2])cout<<"Equilateral"<<endl;
    else if(arr[0]==arr[1]||arr[1]==arr[2])cout<<"Isosceles"<<endl;
    else cout<<"Scalene"<<endl;
}