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++: // 2011/08/22 Tazoe

#include <iostream>
using namespace std;

bool kousa(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4)
{
	if(((x1-x2)*(y3-y1)+(y1-y2)*(x1-x3))*((x1-x2)*(y4-y1)+(y1-y2)*(x1-x4))<0
	 &&((x3-x4)*(y1-y3)+(y3-y4)*(x3-x1))*((x3-x4)*(y2-y3)+(y3-y4)*(x3-x2))<0)
		return true;
	else
		return false;
}

double koutenX(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4)
{
	int bunbo = (x1-x2)*(y3-y4)-(x3-x4)*(y1-y2);
	int bunsi = (x3-x4)*(x1*y2-x2*y1)-(x1-x2)*(x3*y4-x4*y3);

	return (double)bunsi/(double)bunbo;
}

double koutenY(int x1, int y1, int x2, int y2, int x3, int y3, int x4, int y4)
{
	int bunbo = (x1-x2)*(y3-y4)-(x3-x4)*(y1-y2);
	int bunsi = (y3-y4)*(x1*y2-x2*y1)-(y1-y2)*(x3*y4-x4*y3);

	return (double)bunsi/(double)bunbo;
}

int main()
{
	while(true){
		int x1, y1, x2, y2;
		cin >> x1 >> y1 >> x2 >> y2;
		if(x1==0&&y1==0&&x2==0&&y2==0)
			break;

		int x3, y3, x4, y4;
		cin >> x3 >> y3 >> x4 >> y4;
		int x5, y5, x6, y6;
		cin >> x5 >> y5 >> x6 >> y6;

		if(kousa(x1, y1, x2, y2, x3, y3, x4, y4)==false
		 ||kousa(x3, y3, x4, y4, x5, y5, x6, y6)==false
		 ||kousa(x5, y5, x6, y6, x1, y1, x2, y2)==false){
			cout << "kyo" << endl;
			continue;
		}

		double X1 = koutenX(x1, y1, x2, y2, x3, y3, x4, y4);
		double Y1 = koutenY(x1, y1, x2, y2, x3, y3, x4, y4);
		double X2 = koutenX(x3, y3, x4, y4, x5, y5, x6, y6);
		double Y2 = koutenY(x3, y3, x4, y4, x5, y5, x6, y6);
		double X3 = koutenX(x5, y5, x6, y6, x1, y1, x2, y2);
		double Y3 = koutenY(x5, y5, x6, y6, x1, y1, x2, y2);

		double S = (X1*Y2+X2*Y3+X3*Y1-Y1*X2-Y2*X3-Y3*X1)/2.0;
		if(S<0.0)
			S *= -1.0;

		     if(S>=1900000.0)
			cout << "dai-kichi" << endl;
		else if(S>=1000000.0)
			cout << "chu-kichi" << endl;
		else if(S>= 100000.0)
			cout << "kichi" << endl;
		else if(S>       0.0)
			cout << "syo-kichi" << endl;
		else
			cout << "kyo" << endl;
	}

	return 0;
}

C++: #include <vector>
#include <complex>
#include <cstdio>
#include <cassert>
#include <cmath>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()

const double EPS = 1e-8;
const double INF = 1e12;
typedef complex<double> P;
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);
  }
};
bool on_line(const P& a, const L& l){
  return dot(l[0]-a,l[1]-a)<EPS;
}

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;
	for(;~scanf("%d%d%d%d",&x1,&y1,&x2,&y2),x1||y1||x2||y2;){
		L A(P(x1,y1),P(x2,y2));
		scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
		L B(P(x1,y1),P(x2,y2));
		scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
		L C(P(x1,y1),P(x2,y2));
		if(A[0]==A[1]||B[0]==B[1]||C[0]==C[1]){puts("kyo");continue;}
		P a=crosspoint(A,B),b=crosspoint(B,C),c=crosspoint(C,A);
		if(!on_line(a,A)||!on_line(a,B)||!on_line(b,B)||!on_line(b,C)||!on_line(c,C)||!on_line(c,A)){puts("kyo");continue;}
		double s=abs(cross(a,b)+cross(b,c)+cross(c,a));
		if(s<EPS)puts("kyo");
		else if(s<100000)puts("syo-kichi");
		else if(s<1000000)puts("kichi");
		else if(s<1900000)puts("chu-kichi");
		else puts("dai-kichi");
	}
}