#include <stdio.h>
#include <iostream>
#include <vector>
#include <list>
#include <cmath>
#include <fstream>
#include <algorithm>
#include <string>
#include <queue>
#include <set>
#include <map>
#include <complex>
#include <iterator>
#include <cstdlib>
#include <cstring>
#include <sstream>

using namespace std;

#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))

typedef complex<double> P;
typedef long long ll;

const int MAX_SIZE = 10000;

// àÏ
double dot(P a, P b) {
  return (a.real() * b.real() + a.imag() * b.imag());
}
// OÏ
double cross(P a, P b) {
  return (a.real() * b.imag() - a.imag() * b.real());
}
// _cª¼üabãÉ é©È¢©
int is_point_on_line(P a, P b, P c) {
  return EQ( cross(b-a, c-a), 0.0 );
}
// 2¼üÌ¼s»è
int is_orthogonal(P a1, P a2, P b1, P b2) {
  return EQ( dot(a1-a2, b1-b2), 0.0 );
}
// 2¼üÌ½s»è
int is_parallel(P a1, P a2, P b1, P b2) {
  return EQ( cross(a1-a2, b1-b2), 0.0 );
}
// _a,bðÊé¼üÆ_cÌÔÌ£
double distance_l_p(P a, P b, P c) {
  return abs(cross(b-a, c-a)) / abs(b-a);
}
// _a,bð[_Æ·éüªÆ_cÆÌ£
double distance_ls_p(P a, P b, P c) {
  if ( dot(b-a, c-a) < EPS ) return abs(c-a);
  if ( dot(a-b, c-b) < EPS ) return abs(c-b);
  return abs(cross(b-a, c-a)) / abs(b-a);
}
// a1,a2ð[_Æ·éüªÆb1,b2ð[_Æ·éüªÌð·»è
int is_intersected_ls(P a1, P a2, P b1, P b2) {
  return ( cross(a2-a1, b1-a1) * cross(a2-a1, b2-a1) < EPS ) &&
         ( cross(b2-b1, a1-b1) * cross(b2-b1, a2-b1) < EPS );
}
// a1,a2ð[_Æ·éüªÆb1,b2ð[_Æ·éüªÌð_vZ
P intersection_ls(P a1, P a2, P b1, P b2) {
  P b = b2-b1;
  double d1 = abs(cross(b, a1-b1));
  double d2 = abs(cross(b, a2-b1));
  double t = d1 / (d1 + d2);

  return a1 + (a2-a1) * t;
}
// a1,a2ðÊé¼üÆb1,b2ðÊé¼üÌð·»è
int is_intersected_l(P a1, P a2, P b1, P b2) {
  return !EQ( cross(a1-a2, b1-b2), 0.0 );
}
// a1,a2ðÊé¼üÆb1,b2ðÊé¼üÌð_vZ
P intersection_l(P a1, P a2, P b1, P b2) {
  P a = a2 - a1; P b = b2 - b1;
  return a1 + a * cross(b, b1-a1) / cross(b, a);
}
/*
~üÆüªÌð·»è
*/
bool isCircleCrossLine(P a,P b,P c,double r){
	double d1 = abs(a-c);
	double d2 = abs(b-c);
	if(d1<r&&d2<r){
		return false;
	}
	double d = distance_ls_p(a,b,c);
	if(EQ(d,r)||d<r){
		return true;
	}
	else
		return false;
}
// Op`ÌàÉ_ª é©Ç¤©
// OÏÌ³ª·×Ä¯¶ÈçàÉ_ è
bool isInTriangle(P p1,P p2,P p3,P s){
	P a=p1-s;
	P b=p2-s;
	P c=p3-s;
	return ((cross(a,b)>0&&cross(b,c)>0&&cross(c,a)>0)||(cross(a,b)<0&&cross(b,c)<0&&cross(c,a)<0));
}
// Op`ÌÊÏðÀW©çvZ
double calcAreaOfTriangle(P a,P b,P c){
	return abs((b.real()-a.real())*(c.imag()-a.imag()) - (c.real()-a.real())*(b.imag()-a.imag()))/2;
}

int main(){

	vector<pair<P,P> > v;
	int x1,y1,x2,y2;
	while(cin>>x1>>y1>>x2>>y2&&!(x1==0&&y1==0&&x2==0&&y2==0)){
		v.clear();
		v.push_back(make_pair(P(x1,y1),P(x2,y2)));
		for(int i = 0; i < 2; i++){
			cin>>x1>>y1>>x2>>y2;
			v.push_back(make_pair(P(x1,y1),P(x2,y2)));
		}
		// 3ð_
		vector<P> vp;
		bool f=false;
		for(int i = 0; i < 3; i++){
			for(int j = i + 1; j < 3; j++){
				if(is_intersected_ls(v[i].first,v[i].second,v[j].first,v[j].second)){
					// ð_ðvZ
					P p = intersection_ls(v[i].first,v[i].second,v[j].first,v[j].second);
					vp.push_back(p);
				}
				else{
					f=true;
					break;
				}
			}
			if(f)
				break;
		}
		if(f)
			cout<<"kyo"<<endl;
		else{
			if(EQV(vp[0],vp[1])||EQV(vp[1],vp[2])||EQV(vp[2],vp[0])){
				cout<<"kyo"<<endl;
			}
			else{
				// ÊÏvZ
				double S = calcAreaOfTriangle(vp[0],vp[1],vp[2]);
				if(EQ(1900000,S)||S>1900000){
					cout<<"dai-kichi"<<endl;
				}
				else if((EQ(1000000,S)||S>1000000)&&(S<1900000||!EQ(1900000,S))){
					cout<<"chu-kichi"<<endl;
				}
				else if((EQ(100000,S)||S>100000)&&(S<1000000||!EQ(1000000,S))){
					cout<<"kichi"<<endl;
				}
				else if((S>0)&&(S<1000000||!EQ(1000000,S))){
					cout<<"syo-kichi"<<endl;
				}
			}
		}
	}

	return 0;
}

Measured memory_bytes: 0