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 <iostream>
#include <string>
#include <vector>
#include <cmath>
using namespace std;

const double INF = 1e8;
const double eps = 1e-8;

class Point {
public:
    double x, y;
    Point(double x, double y) : x(x), y(y) {};
};

class LineSeg {
public:
    bool vertical;
    double a, b; // y = a * x + b
    Point p1, p2;
    double min_x, max_x, min_y, max_y;
    LineSeg(Point p1, Point p2) : p1(p1), p2(p2) {
        if (p1.x == p2.x) {
            vertical = true;
            a = 0;
            b = 0;
        } else {
            vertical = false;
            a = (p2.y - p1.y) / (p2.x - p1.x);
            b = p1.y - a * p1.x;
        }
        min_x = min(p1.x, p2.x); max_x = max(p1.x, p2.x);
        min_y = min(p1.y, p2.y); max_y = max(p1.y, p2.y);
    }
};

double eq(double x, double y) {
    return abs(x - y) < eps;
}

bool isParallel(LineSeg &L1, LineSeg &L2) {
    if (L1.vertical && L2.vertical) return true;
    if (!L1.vertical && !L2.vertical && abs(L1.a - L2.a) < eps) return true;
    return false;
}

Point intersection(LineSeg L1, LineSeg L2) {
    if (isParallel(L1, L2)) {
        return Point(INF, INF);
    }
    double x, y;
    if (L1.vertical) {
        x = L1.min_x;
        y = L2.a * x + L2.b;
    } else if (L2.vertical) {
        x = L2.min_x;
        y = L1.a * x + L1.b;
    } else {
        x = (L2.b - L1.b) / (L1.a - L2.a);
        y = L1.a * x + L1.b;
    }
    if (x < L1.min_x || L1.max_x < x || y < L1.min_y || L1.max_y < y ||
        x < L2.min_x || L2.max_x < x || y < L2.min_y || L2.max_y < y) {
        return Point(INF, INF);
    }
    return Point(x, y);
}

double areaOfTriangle(Point A, Point B, Point C) {
    return abs((B.x - A.x) * (C.y - A.y) - (B.y - A.y) * (C.x - A.x)) / 2.0;
}

int main() {
    int x1, y1, x2, y2;
    while (cin >> x1 >> y1 >> x2 >> y2, (x1 || y1 || x2 || y2)) {

        vector<LineSeg> L;
        L.push_back( LineSeg(Point(x1,y1), Point(x2,y2)) );
        for (int i=1; i<3; ++i) {
            cin >> x1 >> y1 >> x2 >> y2;
            L.push_back( LineSeg(Point(x1,y1), Point(x2,y2)) );
        }

        bool kyo = false;
        vector<Point> P;
        for (int i=0; i<3 && !kyo; ++i) {
            for (int j=i+1; j<3 && !kyo; ++j) {
                Point p = intersection(L[i], L[j]);
                if (p.x == INF) {
                    kyo = true;
                } else {
                    P.push_back(p);
                }
            }
        }

        if (kyo) {
            cout << "kyo" << endl;
        } else {
            double area = areaOfTriangle(P[0], P[1], P[2]) + eps;
            if (1900000 <= area) {
                cout << "dai-kichi" << endl;
            } else if (1000000 <= area) {
                cout << "chu-kichi" << endl;
            } else if (100000 <= area) {
                cout << "kichi" << endl;
            } else {
                cout << "syo-kichi" << endl;
            }
        }
    }
    return 0;
}