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 <queue>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

#define f first
#define s second
#define mp make_pair

#include<complex>
#define EPS (1e-10)

using namespace std;

using std::complex;
typedef complex<double> P;

static inline bool eq(const P &a, const P &b){
  return abs(a-b) < EPS;
}

static inline double inp(const P &a, const P &b){
  return (conj(a)*b).real();
}

static inline double outp(const P &a, const P &b){
  return (conj(a)*b).imag();
}


struct S{
  P p1;
  P p2;
  S(P p,P q) : p1(p), p2(q) {}
  S(){}
};

int ccw(P p0, P p1, P p2){
  P d1 = p1-p0;
  P d2 = p2-p0;
  double dx1 = d1.real(), dx2 = d2.real();
  double dy1 = d1.imag(), dy2 = d2.imag();

  if(dx1*dy2 > dy1*dx2) return  1;
  if(dx1*dy2 < dy1*dx2) return -1;
  if((dx1*dx2 < 0) || (dy1*dy2 < 0)) return -1;
  if((dx1*dx1+dy1*dy1) < (dx2*dx2+dy2*dy2)) return 1;
  return 0;
}

bool intersect(const S &s1, const S &s2){
  return ((ccw(s1.p1, s1.p2, s2.p1)
	   *ccw(s1.p1, s1.p2, s2.p2)) <= 0)
    &&((ccw(s2.p1, s2.p2, s1.p1)
	*ccw(s2.p1, s2.p2, s1.p2)) <= 0);
}

class Line{
public:
  P p;
  P d;
  Line(){}
  Line(P pos, P dir){p=pos; d=dir/abs(dir);}
};

Line LineDirect(P pos, P dir){
  return Line(pos, dir);
}

Line LinePos(P p1, P p2){
  return Line(p1, p2-p1);
}

P crossPoint(const Line &l1, const Line &l2){
  double num = outp(l2.d, l2.p-l1.p);
  double denom = outp(l2.d, l1.d);
  return P(l1.p + l1.d * num/denom);
}


int main(){
  int x1, y1, x2, y2;
  while(scanf("%d%d%d%d", &x1, &y1, &x2, &y2), (x1 | x2 | y1 | y2)){
    S s[3];
    vector<P> p;

    s[0] = S(P(x1, y1), P(x2, y2));
    REP(i,2){
      scanf("%d%d%d%d", &x1, &y1, &x2, &y2);
      s[i + 1] = S(P(x1, y1), P(x2, y2));
    }

    for(int i = 0; i < 3; i++){
      for(int j = i + 1; j < 3; j++){
	P dir1 = s[i].p1 - s[i].p2;
	P dir2 = s[j].p1 - s[j].p2;

	P tmp = dir1 / dir2;
	if(std::abs(tmp.imag()) > EPS && intersect(s[i], s[j])){
	  Line l1 = LinePos(s[i].p1, s[i].p2);
	  Line l2 = LinePos(s[j].p1, s[j].p2);
	  p.push_back(crossPoint(l1, l2));
	}
      }
    }

    const char *un[] = {
      "dai-kichi",
      "chu-kichi",
      "kichi",
      "syo-kichi",
      "kyo"
    };
    int ans = 4;

    if(p.size() == 3){
      P p1 = p[2] - p[0];
      P p2 = p[1] - p[0];

      double sz = std::abs(outp(p1, p2)) / 2.0;

      if(sz + EPS > 1900000){
	ans = 0;
      }else if(sz + EPS > 1000000){
	ans = 1;
      }else if(sz + EPS > 100000){
	ans = 2;
      }else if(sz > EPS){
	ans = 3;
      }
    }

    puts(un[ans]);
  }
  return 0;
}