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 <cmath>
#include <iostream>
#include <string>
#define EPS 1e-10
using namespace std;

struct point{
	double x,y;
	point(){}
	point(double xx,double yy){
		x=xx;
		y=yy;
	}
	point operator +(point p){
		return point(x+p.x,y+p.y);
	}
	point operator -(point p){
		return point(x-p.x,y-p.y);
	}
	point operator *(double d){
		return point(x*d,y*d);
	}
	double dot(point p){
		return p.x*x+p.y*y;
	}
	double det(point p){
		return x*p.y-y*p.x;
	}
	double len(){
		return sqrt(x*x+y*y);
	}
};

bool on_seg(point p1,point p2,point q){
	return (p2-p1).det(p2-q)==0 && (p1-q).dot(p2-q)<=0;
}

point intersection(point p1,point p2,point q1,point q2){
	return p1+(p2-p1)*((q2-q1).det(q1-p1)/(q2-q1).det(p2-p1));
}

double x[4][4];
double y[4][4];
point p[8];
point g[3];
double len[3];
string check(){
	if((p[0]-p[2]).dot(p[1]-p[3])==0)return "kyo";
	g[0]=intersection(p[0],p[1],p[2],p[3]);
	if(!(on_seg(p[0],p[1],g[0]) && on_seg(p[2],p[3],g[0])))return "kyo";
	if((p[0]-p[4]).dot(p[1]-p[5])==0)return "kyo";
	g[1]=intersection(p[0],p[1],p[4],p[5]);
	if(!(on_seg(p[0],p[1],g[1]) && on_seg(p[4],p[5],g[1])))return "kyo";
	if((p[2]-p[4]).dot(p[3]-p[5])==0)return "kyo";
	g[2]=intersection(p[2],p[3],p[4],p[5]);
	if(!(on_seg(p[2],p[3],g[2]) && on_seg(p[4],p[5],g[2])))return "kyo";
	len[0]=(g[0]-g[1]).len();
	len[1]=(g[1]-g[2]).len();
	len[2]=(g[0]-g[2]).len();
	double s=(len[0]+len[1]+len[2])/2.0;
	double S=sqrt(s*(s-len[0])*(s-len[1])*(s-len[2]));
	if(S<EPS)return "kyo";
	if(S<100000.0)return "syo-kichi";
	if(S<1000000.0)return "kichi";
	if(S<1900000.0)return "chu-kichi";
	return "dai-kichi";
}

int main(void){
	while(1){
		scanf("%lf %lf %lf %lf",&x[0][0],&y[0][0],&x[1][0],&y[1][0]);
		if(x[0][0]==0.0 && y[0][0]==0.0 && x[1][0]==0.0 && y[1][0]==0.0)break;
		p[0]=point(x[0][0],y[0][0]);
		p[1]=point(x[1][0],y[1][0]);
		for(int i=1;i<=2;i++){
			scanf("%lf %lf %lf %lf",&x[0][i],&y[0][i],&x[1][i],&y[1][i]);
			p[i*2+0]=point(x[0][i],y[0][i]);
			p[i*2+1]=point(x[1][i],y[1][i]);
		}
		cout << check() << endl;
	}
	return 0;
}

C++: #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>

using namespace std;

#define reps(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reps(i,0,n)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;

const double EPS = 1e-10;

typedef complex<double> P;
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(){}
	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;
	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;
}

bool crosspoint(const L& l, const L& m, P& out) {
	if(!intersectSS(l, m))
		return false;
	
	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 false;
	out = m[0] + B/A*(m[1]-m[0]);
	return true;
}


int main()
{
	for(;;){
		L s[3];
		rep(i, 3){
			int x1, y1, x2, y2;
			scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
			if(!x1 && !y1 && !x2 && !y2)
				return 0;
			s[i].push_back(P(x1, y1));
			s[i].push_back(P(x2, y2));
		}
		
		P p[3];
		bool ok = true;
		rep(i, 3){
			if(!crosspoint(s[i], s[(i+1)%3], p[i])){
				ok = false;
				break;
			}
		}
		
		double area = 0.0;
		if(ok){
			area = abs(cross(p[1]-p[0], p[2]-p[1])/2.0);
		}
		if(area >= 1900000)
			puts("dai-kichi");
		else if(area >= 1000000)
			puts("chu-kichi");
		else if(area >= 1000000)
			puts("kichi");
		else if(area >= EPS)
			puts("syo-kichi");
		else
			puts("kyo");
	}
	return 0;
}