#include<stdio.h>
#include<math.h>
//ñ³Ìî{ÆÈé_ð çí·\¢Ì
double Square(double x){return x*x;}
struct Point
{
	double x,y;
	Point(double x,double y):x(x),y(y){}
	Point():x(),y(){}
	const Point operator+(const Point &r)const{return Point(x+r.x,y+r.y);}
	const Point operator-(const Point &r)const{return Point(x-r.x,y-r.y);}
};
const Point operator*(const Point &p,double r){return Point(p.x*r,p.y*r);}
const Point operator*(double r,const Point &p){return p*r;}
const double EPS = 0.001;
//üªÌð_ðßÜ·
//»à»àð·µÄÈ©Á½çAfalseðÔµÜ·
bool IntersectionPoint(Point f1, Point t1, Point f2, Point t2, Point *out)
{
	double d = (t1.x-f1.x)*(t2.y-f2.y) - (t1.y-f1.y)*(t2.x-f2.x);
	if(fabs(d)<EPS) return false;	//½s
	double r = ( (t2.y-f2.y)*(f2.x-f1.x)-(t2.x-f2.x)*(f2.y-f1.y) )/d,
		   s = ( (t1.y-f1.y)*(f2.x-f1.x)-(t1.x-f1.x)*(f2.y-f1.y) )/d;
	if(s<=0 || s>1 || r<=0 || r>1) return false;
	*out = f1 + r*(t1-f1);
	return true;
}
double Distance(Point x,Point y)
{
	return sqrt(Square(x.x-y.x)+Square(x.y-y.y));
}

int main()
{
	Point p[6],c1,c2,c3;
	double S,s,a,b,c;
	int i;
	for(;;)
	{
		for(i=0;i<6;++i)
		{
			if(scanf("%lf%lf",&p[i].x,&p[i].y)-2) return 0;
		}
		if(IntersectionPoint(p[0],p[1],p[2],p[3],&c1) && 
			IntersectionPoint(p[2],p[3],p[4],p[5],&c2) && 
			IntersectionPoint(p[4],p[5],p[0],p[1],&c3) )
		{
			a=Distance(c1,c2);
			b=Distance(c2,c3);
			c=Distance(c3,c1);
			s=(a+b+c)/2;
			S=sqrt(s*(s-a)*(s-b)*(s-c));
			if(S>=1900000)puts("dai-kichi");
			else if(S>=1000000)puts("chu-kichi");
			else if(S>=100000)puts("kichi");
			else puts("syo-kichi");
		}
		else puts("kyo");
	}
	return 1;
}