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 "bits/stdc++.h"

using namespace std;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;


#define dump(x)  cerr << #x << " = " << (x) << endl
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(a)  (a).begin(),(a).end()
#define pb push_back
#define EPS (1e-10)


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 * (double a)	{return Point( a*x,a*y );		}
    Point operator / (double a)	{return Point( x/a,y/a );		}
    
    double abs(){ return sqrt(norm());}
    double norm(){ return x*x + y*y; }
    
    bool operator < ( const Point &p ) const{
        return x!= p.x ? x<p.x : y<p.y;
    }
    
    bool operator == ( const Point &p ) const{
        return fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;
    }
};

typedef Point Vector;

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

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


struct Segment{
    Point p1,p2;
};


Point getCrossPoint(Segment s1, Segment s2){
    Vector base = s2.p2-s2.p1;
    double d1=abs(cross(base, s1.p1-s2.p1));
    double d2=abs(cross(base, s1.p2-s2.p1));
    double t=d1/(d1+d2);
    return s1.p1+(s1.p2-s1.p1)*t;
}

int ccw(Point p0, Point p1, Point p2){
    Vector a=p1-p0;
    Vector b=p2-p0;
    if(cross(a,b)>EPS)  return 1;
    if(cross(a,b)<-EPS) return -1;
    if(dot(a,b)<-EPS)   return 2;
    if(a.norm()<b.norm())return -2;
    
    return 0;
}

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


bool isCross(Segment s1,Segment s2){
    return intersect(s1.p1, s1.p2,s2.p1,s2.p2);
}

int main(){
    
    int a,b,c,d;
    while(cin>>a>>b>>c>>d){
        int flag=false;
        if(a==0 && b==0 && c==0 && d==0)break;
        
        Point p[6];
        p[0]=Point(a,b);
        p[1]=Point(c,d);
        rep(i,4){
            int m,n;
            cin>>m>>n;
            p[2+i]=Point(m,n);
        }
        //end input
        
        Segment seg[3];
        rep(i,3){
            seg[i].p1=p[i*2];
            seg[i].p2=p[i*2+1];
        }
        
        Point cr[3];
        rep(i,3){
            if( !isCross( seg[i],seg[ (i+1)%3 ] ) )flag=true;
            else{
                cr[i]=getCrossPoint(seg[i],seg[ (i+1)%3 ]);
                if( isnan(cr[i].x) || isnan(cr[i].y) )flag=true;
            }
        }
        if( abs(cr[0].x-cr[1].x)<EPS && abs(cr[0].y-cr[1].y)<EPS && abs(cr[1].x-cr[2].x)<EPS && abs(cr[1].y-cr[2].y)<EPS )flag=true;
        
        if(flag)cout<<"kyo"<<endl;
        else{
            double ans=abs(  ( cr[0].x * cr[1].y + cr[1].x*cr[2].y + cr[2].x*cr[0].y -cr[0].y*cr[1].x - cr[2].y*cr[0].x )/2  );
            if(ans<100000+EPS)cout<<"syo-kichi"<<endl;
            else if(ans<1000000+EPS)cout<<"kichi"<<endl;
            else if(ans<1900000+EPS)cout<<"chu-kichi"<<endl;
            else cout<<"dai-kichi"<<endl;
            
        }
        
    }
    return 0;
    
}