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 <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++) {
			double dist0, dist1;
			dist0 = sqrt(sqr(v[i*2%6].x - v[(i*2+1)%6].x) + sqr(v[i*2%6].y - v[(i*2+1)%6].y));
			dist1 = sqrt(sqr(v[i*2%6].x - p[i].x) + sqr(v[i*2%6].y - p[i].y))
				+ sqrt(sqr(v[(i*2+1)%6].x - p[i].x) + sqr(v[(i*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);
			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:;
}

C++: #include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<cstdio>
#define EPS (1e-10)
#define COUNTER_CLOCKWISE 1
#define CLOCKWISE -1
#define ONLINE_BACK 2
#define ONLINE_FRONT -2
#define ON_SEGMENT 0
using namespace std;

class Point
{
public:
  double x,y;

  Point(double x =0,double y=0):x(x),y(y){}

  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 * (Point p){return Point(x*p.x,y*p.y); }
};

double dot(Point a,Point b)
{
  return a.x*b.x + a.y*b.y;
}

double cross(Point a,Point b)
{
  return a.x*b.y - a.y*b.x;
}

double norm(Point a)
{
  return a.x*a.x+a.y*a.y;
}

double abs(Point p)
{
  return sqrt(norm(p));
}

int ccw(Point p0,Point p1,Point p2)
{
  Point a = p1-p0;
  Point b = p2-p0;
  if(cross(a,b) > 0)return COUNTER_CLOCKWISE;
  if(cross(a,b) < 0)return CLOCKWISE;
  if(dot(a,b) < 0)return ONLINE_BACK;
  if(norm(a) < norm(b))return ONLINE_FRONT;
  return ON_SEGMENT;
}

bool isIntersect(Point p1,Point p2,Point p3,Point p4)
{
  return (ccw(p1,p2,p3) * ccw(p1,p2,p4) <= 0 &&
          ccw(p3,p4,p1) * ccw(p3,p4,p2) <= 0 );
}

Point getCrossPoint(Point a1,Point a2,Point b1,Point b2)
{
  Point base = b2 - b1;
  double d1 = abs(cross(base,a1-b1));
  double d2 = abs(cross(base,a2-b1));
  double t = d1/(d1+d2);
  return a1+(a2-a1)*t;
}

double getArea(Point p1,Point p2,Point p3)
{
  vector<Point> p;
  p.resize(3);
  p[0] = p1,p[1] = p2,p[2] = p3;
  double sum = 0;
  for(int i=0;i<3;i++)
    sum += cross(p[i],p[(i+1)%3]);
  return fabs(sum)/2.0;
}

int main()
{
  int x1,y1,x2,y2;
  while(true)
    {
      cin >> x1 >> y1 >> x2 >> y2;
      if(x1 == 0 && y1 == 0 && x2 == 0 && y2 == 0)
	break;
      Point a(x1,y1);
      Point b(x2,y2);
      cin >> x1 >> y1 >> x2 >> y2;
      Point c(x1,y1);
      Point d(x2,y2);
      cin >> x1 >> y1 >> x2 >> y2;
      Point e(x1,y1);
      Point f(x2,y2);
      Point c1,c2,c3;
    


      if(!isIntersect(a,b,c,d) || !isIntersect(c,d,e,f) || !isIntersect(e,f,a,b))
	{
	  cout << "kyo" << endl;
	  continue;
	}
      c1 = getCrossPoint(a,b,c,d);
      c2 = getCrossPoint(c,d,e,f);
      c3 = getCrossPoint(e,f,a,b);
      double area = getArea(c1,c2,c3);

      if(area >= 1900000)
	cout << "dai-kichi" << endl;
      else if(area >= 1000000)
	cout << "chu-kichi" << endl;
      else if(area >= 100000)
	cout << "kichi" << endl;
      else if(area > 0)
	cout << "syo-kichi" << endl;
      else 
	cout << "kyo" << endl;
    }
  return 0;
}