#include "bits/stdc++.h"

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;


#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#define EPS (1e-10)


class Point{
public:
    double x,y;
    
    Point (double x=0,double y=0): x(x),y(y){}
    
    Point operator + (Point p)	{return Point( x+p.x,y+p.y );	}
    Point operator - (Point p)	{return Point( x-p.x,y-p.y );	}
    Point operator * (double a)	{return Point( a*x,a*y );		}
    Point operator / (double a)	{return Point( x/a,y/a );		}
    
    double abs(){ return sqrt(norm());}
    double norm(){ return x*x + y*y; }
    
    bool operator < ( const Point &p ) const{
        return x!= p.x ? x<p.x : y<p.y;
    }
    
    bool operator == ( const Point &p ) const{
        return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;
    }
};

typedef Point Vector;

double cross(Vector a, Vector b){
    return a.x*b.y - a.y*b.x;
}

double dot(Vector a, Vector b){
    return a.x*b.x + a.y*b.y;
}


struct Segment{
    Point p1,p2;
};


Point getCrossPoint(Segment s1, Segment s2){
    Vector base = s2.p2-s2.p1;
    double d1=abs(cross(base, s1.p1-s2.p1));
    double d2=abs(cross(base, s1.p2-s2.p1));
    double t=d1/(d1+d2);
    return s1.p1+(s1.p2-s1.p1)*t;
}

int ccw(Point p0, Point p1, Point p2){
    Vector a=p1-p0;
    Vector b=p2-p0;
    if(cross(a,b)>EPS)  return 1;
    if(cross(a,b)<-EPS) return -1;
    if(dot(a,b)<-EPS)   return 2;
    if(a.norm()<b.norm())return -2;
    
    return 0;
}

bool intersect(Point p1,Point p2,Point p3,Point p4){
    return ( ccw(p1,p2,p3)*ccw(p1,p2,p4) <=0 &&
            ccw(p3,p4,p1)*ccw(p3,p4,p2) <=0 );
}


bool isCross(Segment s1,Segment s2){
    return intersect(s1.p1, s1.p2,s2.p1,s2.p2);
}

int main(){
    
    int a,b,c,d;
    while(cin>>a>>b>>c>>d){
        int flag=false;
        if(a==0 && b==0 && c==0 && d==0)break;
        
        Point p[6];
        p[0]=Point(a,b);
        p[1]=Point(c,d);
        rep(i,4){
            int m,n;
            cin>>m>>n;
            p[2+i]=Point(m,n);
        }
        //end input
        
        Segment seg[3];
        rep(i,3){
            seg[i].p1=p[i*2];
            seg[i].p2=p[i*2+1];
        }
        
        Point cr[3];
        rep(i,3){
            if( !isCross( seg[i],seg[ (i+1)%3 ] ) )flag=true;
            else{
                cr[i]=getCrossPoint(seg[i],seg[ (i+1)%3 ]);
                if( isnan(cr[i].x) || isnan(cr[i].y) )flag=true;
            }
        }
        if( cr[0]==cr[1] && cr[1]==cr[2] )flag=true;
        
        if(flag)cout<<"kyo"<<endl;
        else{
            double ans=abs(  ( cr[0].x * cr[1].y + cr[1].x*cr[2].y + cr[2].x*cr[0].y -cr[0].y*cr[1].x - cr[2].y*cr[0].x )/2  );
            if(ans<100000)cout<<"syo-kichi"<<endl;
            else if(ans<1000000)cout<<"kichi"<<endl;
            else if(ans<1900000)cout<<"chu-kichi"<<endl;
            else cout<<"dai-kichi"<<endl;
            
        }
        
    }
    return 0;
    
}