/* SRIJON
        SINGHA
            SAMANTA */
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define nl "\n"
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define yes cout << "YES" << nl
#define no cout << "NO" << nl
#define fi first
#define sec second
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define FIO                           \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL);                    \
    cout.tie(NULL);
const int mod = 1e9 + 7;

void solve()
{

    vector<ll>v(3);
    for(ll i=0;i<3;i++) cin>>v[i];
    sort(all(v));
    if(v[0]+v[1]<=v[2])  cout<<"Not a triangle"<<nl;
    else
    {
        if(v[0]==v[1] && v[0]==v[2])    cout<<"Equilateral"<<nl;
        else if(v[0]==v[1] || v[0]==v[2] || v[1]==v[2])   cout<<"Isosceles"<<nl;
        else cout<<"Scalene"<<nl;
    }           
    

}

int32_t main()
{
    FIO

    ll t=1;
    // cin>>t;
    for(ll i=1;i<=t;i++)
    {
        // cout<<"Case "<<i<<": ";
        solve();           
    }

    return 0;
}