#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<map>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<string>
#include<vector>
#include<functional>

using namespace std;

const double EPS=1e-12;
const double INF=1e12;

typedef complex<double>Point;

namespace std{
    bool operator<(const Point &P,const Point &Q){
        return real(P)!=real(Q)?real(P)<real(Q):imag(P)<imag(Q);
    }
}

double dot(const Point &P,const Point &Q){
    return real(P)*real(Q)+imag(P)*imag(Q);
}

double cross(const Point &P,const Point &Q){
    return real(P)*imag(Q)-real(Q)*imag(P);
}

struct Line{
    Point a,b;
    Line(Point P,Point Q){
        a=P;b=Q;
    }
    Line(){}
};

struct Segment{
    Point a,b;
    Segment(Point P,Point Q){
        a=P;b=Q;
    }
    Segment(){}
};

struct Circle{
    Point c;
    double r;
    Circle(Point P,double l){
        c=P;r=l;
    }
};

typedef vector<Point>Polygon;

int ccw(Point A,Point B,Point C){
    B-=A;C-=A;
    if(cross(B,C)>0)return 1; //ccw
    if(cross(B,C)<0)return -1; //cw
    if(dot(B,C)<0)return 2; //c-b-a
    if(norm(B)<norm(C))return -2; //a-b-c
    return 0; //a-c-b
}

inline bool parallelism(const Line &L,const Line &M){
    return fabs(cross(L.a-L.b,M.a-M.b))<EPS;
}

inline bool orthogonal(const Line &L,const Line &M){
    return fabs(dot(L.a-L.b,M.a-M.b))<EPS;
}

inline bool intersect(const Line &L,const Line &M){
    return cross(L.a-L.b,M.a-M.b)>EPS ||cross(L.a-L.b,M.a-M.b)<-EPS;
}

inline bool intersect(const Line &L,const Segment &S){
    return cross(L.b-L.a,S.a-L.a)*cross(L.b-L.a,S.b-L.a)<-EPS;
}

inline bool intersect(const Line &L,const Point &P){
    return abs(ccw(L.a,L.b,P))!=1;
}

inline bool intersect(const Segment &S, const Segment &T){
    return ccw(S.a,S.b,T.a)*ccw(S.a,S.b,T.b)<=0&&
        ccw(T.a,T.b,S.a)*ccw(T.a,T.b,S.b) <= 0;
}

inline bool intersect(const Segment &S,const Point &P){
    return ccw(S.a,S.b,P)==0;
}

inline bool intersect(const Circle &C,const Point &P){
    return abs(C.c-P)<=C.r+EPS;
}

inline bool intersect(const Circle &C,const Circle &D){
    return abs(C.c-D.c)<=C.r+D.r&&abs(C.c-D.c)>=fabs(C.r-D.r);
}

inline bool onSameLine(const Segment &S,const Segment &T){
    return abs(ccw(S.a,S.b,T.a)*ccw(S.a,S.b,T.b))!=1;
}

inline Point crossPoint(const Line &L,const Line &M){
    double crs=cross(L.b-L.a,M.b-M.a);
    return M.a+(M.b-M.a)*cross(L.b-L.a,L.a-M.a)*(1.0/crs);
}

inline Point crossPoint(const Segment &S,const Segment &T){
    double crs=cross(S.b-S.a,T.b-T.a);
    return T.a+(T.b-T.a)*cross(S.b-S.a,S.b-T.a)*(1.0/crs);
}
double areaTriangle(Point A,Point B,Point C){
    B-=A;C-=A;
    return fabs(cross(B,C))*0.5;
}

double areaPolygon(Polygon &G){
    const int Sz=G.size();
    if(Sz<3)return 0;
    if(Sz==3)return areaTriangle(G[0],G[1],G[2]);

    double res=cross(G[Sz-1],G[0]);
    for(int i=1;i<Sz;i++)res+=cross(G[i-1],G[i]);

    return fabs(res)*0.5;
}



int main(){
    double x1,x2,y1,y2;
    while(cin>>x1>>y1>>x2>>y2,x1||y1||x2||y2){
        Segment S[3];
        S[0]=Segment(Point(x1,y1),Point(x2,y2));
        for(int i=1;i<3;i++){
            cin>>x1>>y1>>x2>>y2;
            S[i]=Segment(Point(x1,y1),Point(x2,y2));
        }
        bool flag=false;
        for(int i=0;i<3;i++){
            flag|=(!intersect(S[i],S[(i+1)%3]));
            flag|=onSameLine(S[i],S[(i+1)%3]);
        }
        if(flag){
            cout<<"kyo"<<endl;
            continue;
        }
        Point P[3];
        for(int i=0;i<3;i++){
            P[i]=crossPoint(S[i],S[(i+1)%3]);
        }
        double me=areaTriangle(P[0],P[1],P[2]);

        if(me==0)cout<<"kyo"<<endl;
        else if(me<100000)cout<<"syo-kichi"<<endl;
        else if(me<1000000)cout<<"kichi"<<endl;
        else if(me<1900000)cout<<"chu-kichi"<<endl;
        else cout<<"dai-kichi"<<endl;

    }
    return 0;
}

Measured memory_bytes: 1236