Go: package main

import (
	"bufio"
		"os"
	"strings"
	"strconv"
	"fmt"
	"math"
)

var scanner = bufio.NewScanner(os.Stdin)

type Point struct {
	x, y float64
}
func main() {
	for scanner.Scan() {
		buf1 := strings.Split(scanner.Text(), " ")
		line1 := make([]float64, len(buf1))
		for i := range line1 {
			line1[i], _ = strconv.ParseFloat(buf1[i], 64)
		}
		if line1[0] == 0 && line1[1] == 0 &&
			line1[2] == 0 && line1[3] == 0 {
				break
		}
		scanner.Scan()
		buf2 := strings.Split(scanner.Text(), " ")
		line2 := make([]float64, len(buf2))
		for i := range line2 {
			line2[i], _ = strconv.ParseFloat(buf2[i], 64)
		}
		scanner.Scan()
		buf3 := strings.Split(scanner.Text(), " ")
		line3 := make([]float64, len(buf3))
		for i := range line2 {
			line3[i], _ = strconv.ParseFloat(buf3[i], 64)
		}
		if !intersect(line1[0], line1[1], line1[2], line1[3], line2[0], line2[1], line2[2], line2[3]) ||
			!intersect(line2[0], line2[1], line2[2], line2[3], line3[0], line3[1], line3[2], line3[3]) ||
			!intersect(line3[0], line3[1], line3[2], line3[3], line1[0], line1[1], line1[2], line1[3]) {
				fmt.Println("kyo")
		} else {
			p1 := intersection(line1[0], line1[1], line1[2], line1[3], line2[0], line2[1], line2[2], line2[3])
			p2 := intersection(line2[0], line2[1], line2[2], line2[3], line3[0], line3[1], line3[2], line3[3])
			p3 := intersection(line3[0], line3[1], line3[2], line3[3], line1[0], line1[1], line1[2], line1[3])
			area := math.Abs((p2.x - p1.x) * (p3.y - p1.y) - (p2.y - p1.y) * (p3.x - p1.x))/2
			if area < 0.00000001 {
				fmt.Println("kyo")
			} else if 1899999.99999999 < area {
				fmt.Println("dai-kichi")
			} else if 999999.99999999 < area {
				fmt.Println("chu-kichi")
			} else if 99999.99999999 < area {
				fmt.Println("kichi")
			} else {
				fmt.Println("syo-kichi")
			}
		}
	}
}

func cross(x1, y1, x2, y2 float64) int {
	z :=  x1 * y2 - y1 * x2
	if 0 < z {
		return 1
	} else if z < 0 {
		return -1
	} else {
		return 0
	}
}

func intersect(x1, y1, x2, y2, x3, y3, x4, y4 float64) bool {
	if 0 <= cross(x2-x1, y2-y1, x3-x1, y3-y1) *
		cross(x2-x1, y2-y1, x4-x1, y4-y1) {
			return false
	}
	if 0 <= cross(x4-x3, y4-y3, x1-x3, y1-y3) *
		cross(x4-x3, y4-y3, x2-x3, y2-y3) {
			return false
	}
	return true
}

func intersection(x1, y1, x2, y2, x3, y3, x4, y4 float64) Point {
	if x3 == x4 {
		x1, x3 = x3, x1
		y1, y3 = y3, y1
		x2, x4 = x4, x2
		y2, y4 = y4, y2
	}
	ret := Point{}
	if x1 == x2 {
		// y軸に平行な直線の場合
		c := (y4 - y3) / (x4 - x3)
		d := y3 - c * x3
		x := x1
		y := c * x + d
		ret.x, ret.y = x, y
	} else {
		a := (y2 - y1) / (x2 - x1)
		b := y1 - a * x1
		c := (y4 - y3) / (x4 - x3)
		d := y3 - c * x3
		x := (d - b) / (a - c)
		y := a * x + b
		ret.x, ret.y = x, y
	}
	return ret
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-8;
typedef long long ll;
#define rep(i,n) for(int i=0;i<n;i++)
#define rev(i,n) for(int i=n-1;i>=0;i--)
#define sz(a) a.size()
#define all(a) a.begin(),a.end()
#define mp(a,b) make_pair(a,b)
#define pb(a) push_back(a)
#define SS stringstream
#define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts("");
#define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");}
#define bitcount(b) __builtin_popcount(b)
#define REP(i, s, e) for ( int i = s; i <= e; i++ )  

const double INF = 1e12;
typedef complex<double> P,point;
typedef vector<P> G,polygon;
namespace std {bool operator < (const P& a, const P& b) {return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);}}
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);}};
struct C {P p; double r;C(const P &p, double r) : p(p), r(r) { }};
int ccw(P a, P b, P c) {b -= a; c -= a;if (cross(b, c) > 0)   return +1;if (cross(b, c) < 0)   return -1;if (dot(b, c) < 0) return +2;if (norm(b) < norm(c)) return -2;return 0;}
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;}

// Where is Point in Polygon? //
#define curr(P, i) P[i]
#define next(P, i) P[(i+1)%P.size()]
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];return m[0] + B / A * (m[1] - m[0]);}
double getArea(P a, P b , P c){
		b-=a, c-=a;
		return fabs( b.real() * c.imag() - c.real() * b.imag() ) / 2.0	; 
}
int main(){
	double a,b,c,d;
	while(cin >> a >> b >> c >> d , a+b+c+d != 0){
		L one = L(P(a,b),P(c,d));
		cin >> a >> b >> c >> d;
		L two = L(P(a,b),P(c,d));
		cin >> a >> b >> c >> d;
		L three = L(P(a,b),P(c,d));
		double ret = 0;
		if(intersectSS(one,two) && intersectSS(two,three) && intersectSS(one,three)){
			ret = getArea( crosspoint(one,two) , crosspoint(two,three) , crosspoint(one,three) );
		}
		if(ret == 0){
			cout << "kyo" << endl;
		}else if(ret < 100000){
			cout << "syo-kichi" << endl;
		}else if(ret < 1000000){
			cout << "kichi" << endl;
		}else if(ret < 1900000){
			cout << "chu-kichi" << endl;
		}else{
			cout << "dai-kichi" << endl;
		}
	}
}

C++: #include <iostream>
#include <cmath>
#include <utility>
#include <vector>
#include <string>
using namespace std;

typedef pair<double,double> pdd;
#define x first
#define y second
const double EPS = 1e-9;
const double INF = 1e18;

template<class T>
T sqr(T obj) { return obj * obj; }

pdd pt(pdd a0, pdd a1, pdd b0, pdd b1) {
	double div;
	pdd ret;

	div = (a1.y - a0.y) * (b1.x - b0.x) - (b1.y - b0.y) * (a1.x - a0.x);
	if(fabs(div) < EPS)
		return pdd(INF,INF);

	ret.x = (a1.x - a0.x) * (b1.x * b0.y - b0.x * b1.y) - (b1.x - b0.x) * (a1.x * a0.y - a0.x * a1.y);
	ret.y = (a1.y - a0.y) * (b1.x * b0.y - b0.x * b1.y) - (b1.y - b0.y) * (a1.x * a0.y - a0.x * a1.y);
	ret.x /= div;
	ret.y /= div;

	return ret;
}

int main() {
	while(1) {
		vector<pdd> v;
		for(int i = 0; i < 3; i++) {
			for(int j = 0; j < 2; j++) {
				double a, b;
				cin >> a >> b;
				v.push_back(pdd(a,b));
			}
			if(fabs(v[0].x) < EPS && fabs(v[0].y) < EPS && fabs(v[1].x) < EPS && fabs(v[1].y) < EPS)
				goto EXIT;
		}

		vector<pdd> p;
		for(int i = 0; i < 3; i++) {
			p.push_back(pt(v[i*2 % 6], v[(i*2+1) % 6], v[(i+1)*2 % 6], v[((i+1)*2+1) % 6]));
		}

		string res = "";
		for(int i = 0; i < p.size(); i++) {
			for(int j = 0; j < 2; j++) {
				double dist0, dist1;
				dist0 = sqrt(sqr(v[(i+j)*2%6].x - v[((i+j)*2+1)%6].x) + sqr(v[(i+j)*2%6].y - v[((i+j)*2+1)%6].y));
				dist1 = sqrt(sqr(v[(i+j)*2%6].x - p[i].x) + sqr(v[(i+j)*2%6].y - p[i].y))
					+ sqrt(sqr(v[((i+j)*2+1)%6].x - p[i].x) + sqr(v[((i+j)*2+1)%6].y - p[i].y));
				if(p[i].x == INF || p[i].y == INF || fabs(dist0 - dist1) > EPS) {
					res = "kyo";
				}
				//cout << p[i].x << "," << p[i].y << endl;
			}
		}

		if(res == "") {
			double S;
			S = ((p[1].x - p[0].x) * (p[2].y - p[0].y) - (p[1].y - p[0].y) * (p[2].x - p[0].x)) / 2;
			S = fabs(S);

			if(S + EPS>= 1900000)
				res = "dai-kichi";
			else if(S + EPS >= 1000000)
				res = "chu-kichi";
			else if(S + EPS >= 100000)
				res = "kichi";
			else if(S < EPS)
				res = "kyo";
			else
				res = "syo-kichi";
		}
		cout << res << endl;
	}

EXIT:;
}