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 <complex>

using namespace std;

const double EPS=1e-9;

typedef complex<double> Point;
struct Line{
	Point pos,dir;
	Line(){}
	Line(Point p,Point d):pos(p),dir(d){}
};
typedef Line Segment;

int Signum(double x)
{
	return abs(x)<EPS?0:x<0?-1:1;
}
double Dot(Point a,Point b)
{
	return real(conj(a)*b);
}
double Cross(Point a,Point b)
{
	return imag(conj(a)*b);
}
double CCW(Point a,Point b,Point c)
{
	Point d1=b-a,d2=c-a;
	double sign=Signum(Cross(d1,d2));
	if(sign)
		return sign;
	if(Dot(d1,d2)<-EPS)
		return -2;
	if(norm(d1)<norm(d2)-EPS)
		return 2;
	return 0;
}

// 直線と線分が重なるとき，線分の端点が直線上にあるときもtrue
bool IntersectLS(Line a,Segment b)
{
	return CCW(a.pos,a.pos+a.dir,b.pos)*CCW(a.pos,a.pos+a.dir,b.pos+b.dir)<=0;
}
bool IntersectSS(Segment a,Segment b)
{
	return IntersectLS(a,b) && IntersectLS(b,a);
}

// aとbが平行でないことが前提
Point IntersectPoint(Line a,Line b)
{
	return a.pos+a.dir*Cross(b.pos-a.pos,b.dir)/Cross(a.dir,b.dir);
}

const char* solve(Line* ls)
{
	Point ps[3];
	for(int i=0;i<3;i++){
		Line l1=ls[i],l2=ls[(i+1)%3];
		if(Signum(Cross(l1.dir,l2.dir))==0)
			return "kyo";
		if(!IntersectSS(l1,l2))
			return "kyo";
		ps[i]=IntersectPoint(l1,l2);
	}
	
	double area=abs(Cross(ps[1]-ps[0],ps[2]-ps[0]));
	if(area<1.0e5-EPS)
		return "syo-kichi";
	if(area<1.0e6-EPS)
		return "kichi";
	if(area<1.9e6-EPS)
		return "chu-kichi";
	return "dai-kichi";
}

int main()
{
	for(;;){
		Line ls[3];
		for(int i=0;i<3;i++){
			int x1,y1,x2,y2; scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
			ls[i]=Line(Point(x1,y1),Point(x2-x1,y2-y1));
		}
		if(feof(stdin))
			break;
		puts(solve(ls));
	}
	
	return 0;
}

C++: # -*- coding: utf-8 -*-
EPS = 1e-9

class Point
  attr_reader :x, :y
  def initialize(x, y=nil)
    @x, @y = x, y if y
    @x, @y = x[0], x[1] unless y
  end
  def +(other)
    Point.new(@x + other.x, @y + other.y)
  end
  def -(other)
    Point.new(@x - other.x, @y - other.y)
  end
  def *(other)
    Point.new(@x * other, @y * other)
  end
end

class Line
  attr_reader :s, :t
  def initialize(s, t=nil)
    @s, @t = s, t if t
    @s, @t = Point.new(s[0..1]), Point.new(s[2..3]) unless t
  end
end

def dot(a, b); a.x * b.x + a.y * b.y; end
def cross(a, b);  a.x * b.y - b.x * a.y; end

def is_intersected_ls(a, b)
  cross(a.t - a.s, b.s - a.s) * cross(a.t - a.s, b.t - a.s) < EPS and
    cross(b.t - b.s, a.s - b.s) * cross(b.t - b.s, a.t - b.s) < EPS
end

def intersection_ls(a, b)
  tmp = b.t - b.s

  d1 = cross(tmp, a.s - b.s).abs
  d2 = cross(tmp, a.t - b.s).abs
  t = d1 / (d1 + d2)

  a.s + (a.t - a.s) * t
end

def area(points)
  cross(points[0] - points[2], points[1] - points[2]).abs / 2
end

def fortune(x)
  case x
  when 0; "kyo"
  when 0..100000; "syo-kichi"
  when 0..1000000; "kichi"
  when 0..1900000; "chu-kichi"
  else; "dai-kichi"
  end
end

while input = gets.split.map(&:to_i) and input.count(0) != 4
  l = [ Line.new(input) ]
  2.times{ l << Line.new(gets.split.map(&:to_i)) }

  res = nil
  points = []
  for i in 0..2
    res = "kyo" unless is_intersected_ls(l[i], l[(i + 1) % 3])

    points << intersection_ls(l[i], l[(i + 1) % 3]) unless res
  end

  res = fortune(area(points)) unless res

  puts res
end

C++: #include <cstdio>
#include <complex>

using namespace std;

const double EPS=1e-9;

typedef complex<double> Point;
struct Line{
	Point pos,dir;
	Line(){}
	Line(Point p,Point d):pos(p),dir(d){}
};
typedef Line Segment;

int Signum(double x)
{
	return abs(x)<EPS?0:x<0?-1:1;
}
double Dot(Point a,Point b)
{
	return real(conj(a)*b);
}
double Cross(Point a,Point b)
{
	return imag(conj(a)*b);
}
double CCW(Point a,Point b,Point c)
{
	Point d1=b-a,d2=c-a;
	double sign=Signum(Cross(d1,d2));
	if(sign)
		return sign;
	if(Dot(d1,d2)<-EPS)
		return -2;
	if(norm(d1)<norm(d2)-EPS)
		return 2;
	return 0;
}

// 直線と線分が重なるとき，線分の端点が直線上にあるときもtrue
bool IntersectLS(Line a,Segment b)
{
	return CCW(a.pos,a.pos+a.dir,b.pos)*CCW(a.pos,a.pos+a.dir,b.pos+b.dir)<=0;
}
bool IntersectSS(Segment a,Segment b)
{
	return IntersectLS(a,b) && IntersectLS(b,a);
}

// aとbが平行でないことが前提
Point IntersectPoint(Line a,Line b)
{
	return a.pos+a.dir*Cross(b.pos-a.pos,b.dir)/Cross(a.dir,b.dir);
}

const char* solve(Line* ls)
{
	Point ps[3];
	for(int i=0;i<3;i++){
		Line l1=ls[i],l2=ls[(i+1)%3];
		if(Signum(Cross(l1.dir,l2.dir))==0)
			return "kyo";
		if(!IntersectSS(l1,l2))
			return "kyo";
		ps[i]=IntersectPoint(l1,l2);
	}
	
	double area=abs(Cross(ps[1]-ps[0],ps[2]-ps[0]));
	if(area<1.0e5-EPS)
		return "syo-kichi";
	if(area<1.0e6-EPS)
		return "kichi";
	if(area<1.9e5-EPS)
		return "chu-kichi";
	return "dai-kichi";
}

int main()
{
	for(;;){
		Line ls[3];
		for(int i=0;i<3;i++){
			int x1,y1,x2,y2; scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
			ls[i]=Line(Point(x1,y1),Point(x2-x1,y2-y1));
		}
		if(feof(stdin))
			break;
		puts(solve(ls));
	}
	
	return 0;
}