#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define dq deque<long long>
#define mpp map<long long,long long>
#define ms multiset<long long>
#define ss set<long long>
#define vpp vector<pair<long long, long long>>
#define MOD 1000000007
#define yes cout<<"Yes"<<endl
#define no cout<<"No"<<endl
#define all(a) a.begin(),a.end()
#define sort_rev(a) sort(a.rbegin(),a.rend())
#define print(a) for(auto it:a)cout<<it<<" "
#define print_pair(a) for(auto it:a)cout<<it.first<<" "<<it.second<<endl
#define scan(a,n) for(int i=0;i<n;i++)cin>>a[i]
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
void solve(){
    ll a,b,c;cin>>a>>b>>c;
    ss s;
    s.insert(a);
    s.insert(b);
    s.insert(c);
    ll min1= min(a, min(b,c));
    ll maxi= max(a,max(b,c));
    ll mini2=a+b+c- min1-maxi;
    if (min1+mini2<maxi){
        cout<<"Not a triangle"<<endl;
        return;
    }
    if (s.size()==3)cout<<"Scalene"<<endl;
    else if (s.size()==2)cout<<"Isosceles"<<endl;
    else if (s.size()==1)cout<<"Equilateral"<<endl;
}
int main() {
    requisite();
    ll t=1;
//    cin>>t;
    while (t--){
        solve();
    }
    return 0;
}