#include <cstdio>
#include <complex>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cassert>
using namespace std;

#define EPS 1e-8
typedef complex<double> P;

bool isequal(const P& a, const P& b)
{
	return a.real()+EPS > b.real() && a.real() < b.real()+EPS &&
		   a.imag()+EPS > b.imag() && a.imag() < b.imag()+EPS;
}

double cross(const P& a, const P& b) {
  return imag(conj(a)*b);
}
double dot(const P& a, const P& b) {
  return real(conj(a)*b);
}

struct L : public vector<P> {
  L(const P &a, const P &b) {
    push_back(a); push_back(b);
  }
};

int ccw(P a, P b, P c) {
  b -= a; c -= a;
  if (cross(b, c) > 0)   return +1;       // counter clockwise
  if (cross(b, c) < 0)   return -1;       // clockwise
  if (dot(b, c) < 0)     return +2;       // c--a--b on line
  if (norm(b) < norm(c)) return -2;       // a--b--c on line
  return 0;
}

bool intersectLL(const L &l, const L &m) {
  return abs(cross(l[1]-l[0], m[1]-m[0])) > EPS; // non-parallel
}

bool intersectSS(const L &s, const L &t) {
  return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&
         ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;
}

P crosspoint(const L &l, const L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line
  if (abs(A) < EPS) assert(false); // !!!PRECONDITION NOT SATISFIED!!!
  return m[0] + B / A * (m[1] - m[0]);
}

int main()
{
	int x1,y1,x2,y2;
	while(scanf("%d%d%d%d", &x1,&y1,&x2,&y2), (x1||y1||x2||y2))
	{
		vector<L> Lines;
		vector<P> xp;
		Lines.push_back(L(P(x1,y1),P(x2,y2)));
		for(int i=0; i<2; i++)
		{
			scanf("%d%d%d%d", &x1,&y1,&x2,&y2);
			Lines.push_back(L(P(x1,y1),P(x2,y2)));
		}
		
		bool g=true;
		for(int i=0; i<3; i++)
		for(int j=i+1; j<3; j++)
		{
			if(!intersectLL(Lines[i], Lines[j])) g=false;
			if(!intersectSS(Lines[i], Lines[j])) g=false;
			
			if(g)
			{
				xp.push_back(crosspoint(Lines[i], Lines[j]));
			}
		}
		
		for(int i=0; i<xp.size(); i++)
		for(int j=i+1; j<xp.size(); j++)
		{
			if(isequal(xp[i], xp[j])) g=false;
		}
		
		if(!g)
		{
			puts("kyo");
			continue;
		}
		
		int cnt=0;
		double ls[3];
		for(int i=0; i<xp.size(); i++)
		for(int j=i+1; j<xp.size(); j++)
		{
			ls[cnt]=sqrt((xp[i].real()-xp[j].real())*(xp[i].real()-xp[j].real())+(xp[i].imag()-xp[j].imag())*(xp[i].imag()-xp[j].imag()));
			cnt++;
		}
		
		double s=ls[0]+ls[1]+ls[2];
		double area=sqrt(s*(s-ls[0])*(s-ls[1])*(s-ls[2]));
		
		if(area < 100000) puts("syo-kichi");
		else if(area < 1000000) puts("kichi");
		else if(area < 1900000) puts("chu-kichi");
		else	puts("dai-kichi");
	}
}