#include<stdio.h>
#include<math.h>
#include<algorithm>
using namespace std;
bool intersect(int ax,int ay,int bx,int by,int cx,int cy,int dx,int dy){
	long long ta=(cx-dx)*(ay-cy)+(cy-dy)*(cx-ax);
	long long tb=(cx-dx)*(by-cy)+(cy-dy)*(cx-bx);
	long long tc=(ax-bx)*(cy-ay)+(ay-by)*(ax-cx);
	long long td=(ax-bx)*(dy-ay)+(ay-by)*(ax-dx);
	if(ta*tb<=0LL&&tc*td<=0LL)return true;
	else return false;
}
pair<double,double>getpoint(int ax,int ay,int bx,int by,int cx,int cy ,int dx,int dy){
	double acx=cx-ax;
	double acy=cy-ay;
	double bunbo=(bx-ax)*(dy-cy)-(by-ay)*(dx-cx);
	double r=(acx*(dy-cy)-acy*(dx-cx))/bunbo;
	return make_pair(ax+(bx-ax)*r,ay+(by-ay)*r);
}
double ABS(double a){return a<0.0?-a:a;}
int main(){
	int x1,x2,x3,x4,x5,x6;
	int y1,y2,y3,y4,y5,y6;
	while(scanf("%d%d%d%d",&x1,&y1,&x2,&y2),x1||x2||y1||y2){
		scanf("%d%d%d%d%d%d%d%d",&x3,&y3,&x4,&y4,&x5,&y5,&x6,&y6);
		if(!intersect(x1,y1,x2,y2,x3,y3,x4,y4))printf("kyo\n");
		else if(!intersect(x1,y1,x2,y2,x5,y5,x6,y6))printf("kyo\n");
		else if(!intersect(x5,y5,x6,y6,x3,y3,x4,y4))printf("kyo\n");
		else{
			pair<double,double> p,q,r;
			p=getpoint(x1,y1,x2,y2,x3,y3,x4,y4);
			q=getpoint(x1,y1,x2,y2,x5,y5,x6,y6);
			r=getpoint(x5,y5,x6,y6,x3,y3,x4,y4);
			q=make_pair(q.first-p.first,q.second-p.second);
			r=make_pair(r.first-p.first,r.second-p.second);
			double S=ABS(q.first*r.second-q.second*r.first)/2;
			if(S<0.00001)printf("kyo\n");
			else if(S<100000.0-0.00001)printf("syo-kichi\n");
			else if(S<1000000.0-0.00001)printf("kichi\n");
			else if(S<1900000.0-0.00001)printf("chu-kichi\n");
			else printf("dai-kichi\n");
		}
	}
}