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 <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <set>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <cstdio>
#include <cstring>
#include <iterator>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <utility>
#include <memory>
#include <functional>
#include <deque>
#include <cctype>
#include <ctime>
#include <numeric>
#include <list>
#include <iomanip>

#if __cplusplus >= 201103L
#include <array>
#include <tuple>
#include <initializer_list>
#include <forward_list>

#define cauto const auto&
#else

#endif

using namespace std;


typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vint;
typedef vector<vector<int> > vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long> > vvll, vvLL;

#define VV(T) vector<vector< T > >

template <class T>
void initvv(vector<vector<T> > &v, int a, int b, const T &t = T()){
    v.assign(a, vector<T>(b, t));
}

template <class F, class T>
void convert(const F &f, T &t){
    stringstream ss;
    ss << f;
    ss >> t;
}

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define reep(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) reep((i),0,(n))
#define ALL(v) (v).begin(),(v).end()
#define PB push_back
#define F first
#define S second
#define mkp make_pair
#define RALL(v) (v).rbegin(),(v).rend()
#define DEBUG
#ifdef DEBUG
#define dump(x)  cout << #x << " = " << (x) << endl;
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#else
#define dump(x) 
#define debug(x) 
#endif

#define MOD 1000000007LL
#define EPS 1e-8
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define maxs(x,y) x=max(x,y)
#define mins(x,y) x=min(x,y)

typedef complex<double> P;
 
// 2??????????????????????????????????????????
#define EQ(a,b) (abs((a)-(b)) < EPS)
// 2??????????????????????????????????????????
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
 
// // ????????????a?????????????????????n1,n2????±???????
// P n1 = a * P(0, 1);
// P n2 = a * P(0, -1);
 
// // ????????????a???????????????????????????un1,un2????±???????
// P un1 = (a * P(0, +1)) / abs(a);
// P un2 = (a * P(0, -1)) / abs(a);
 
// ?????? (dot product) : a???b = |a||b|cos??
double dot(P a, P b) {
    return (a.real() * b.real() + a.imag() * b.imag());
}
 
// ?????? (cross product) : a??b = |a||b|sin??
double cross(P a, P b) {
    return (a.real() * b.imag() - a.imag() * b.real());
}
 
// 2??´????????´????????? : a??\b <=> dot(a, b) = 0
int is_orthogonal(P a1, P a2, P b1, P b2) {
    return EQ( dot(a1-a2, b1-b2), 0.0 );
}
 
// 2??´?????????????????? : a//b <=> cross(a, b) = 0
int is_parallel(P a1, P a2, P b1, P b2) {
    return EQ( cross(a1-a2, b1-b2), 0.0 );
}
 
// ???c?????´???a,b???????????????????????? ???????????? WA?????????
// int is_point_on_line(P a, P b, P c) {
//   return EQ( cross(b-a, c-a), 0.0 );
// }
 
// ???c?????????a,b????????????????????????(1)
int is_point_on_line(P a, P b, P c) {
    return EQ( cross(b-a, c-a), 0.0 ) &&
        (dot(b-a, c-a) > -EPS) &&
        (dot(a-b, c-b) > -EPS);
}
 
// ???c?????????a,b????????????????????????(2)
// |a-c| + |c-b| <= |a-b| ???????????????
// int is_point_on_line(P a, P b, P c) {
  // return (abs(a-c) + abs(c-b) < abs(a-b) + EPS);
// }
// a??????b???????????£???, 1 -> ???, -1 -> ???, 2 -> a????????????, -2 -> b??????????\\??????, 0 -> ??????ab???????????¨
int ccw(P a,P b, P c){
    P d = b - a;
    c -= a;
    double cr = cross(d, c);
    if(cr < -EPS){ return 1; }
    if(cr > EPS){ return -1; }
    if(dot(d, c) < -EPS){ return 2; }
    if(norm(d) < norm(c) - EPS){ return -2; }
    return 0;
}

// ???a,b???????????´?????¨???c??¨????????¢
double distance_l_p(P a, P b, P c) {
    return abs(cross(b-a, c-a)) / abs(b-a);
}

 
// ???a,b???????????¨??????????????¨???c??¨????????¢
double distance_ls_p(P a, P b, P c) {
    if(dot(b-a, c-a) < EPS) return abs(c-a);
    if(dot(a-b, c-b) < EPS) return abs(c-b);
    return abs(cross(b-a, c-a)) / abs(b-a);
}
// a1,a2???????????¨??????????????¨b1,b2???????????¨???????????????????????????
int is_intersected_ls(P a1, P a2, P b1, P b2) {
	return ccw(a1,a2,b1) * ccw(a1,a2,b2) <= 0 &&
		   ccw(b1,b2,a1) * ccw(b1,b2,a2) <= 0;
}
 
// a1,a2???????????¨??????????????¨b1,b2???????????¨??????????????????????¨????
P intersection_ls(P a1, P a2, P b1, P b2) {
    P b = b2-b1;
    double d1 = abs(cross(b, a1-b1));
    double d2 = abs(cross(b, a2-b1));
    double t = d1 / (d1 + d2);

    return a1 + (a2-a1) * t;
}
 
// a1,a2???????????´?????¨b1,b2???????????´??????????????????
int is_intersected_l(P a1, P a2, P b1, P b2) {
    return !EQ( cross(a1-a2, b1-b2), 0.0 );
}
 
// a1,a2???????????´?????¨b1,b2???????????´?????????????¨????
P intersection_l(P a1, P a2, P b1, P b2) {
    P a = a2 - a1; P b = b2 - b1;
    return a1 + a * cross(b, b1-a1) / cross(b, a);
}

typedef pair<P,P> S;

bool is_intersected(S a, S b){
	if(abs(ccw(a.F, a.S, b.F))!=1&&abs(ccw(a.F, a.S, b.S))!=1) return false;
	if(!is_intersected_ls(a.F, a.S, b.F, b.S)) return false;
	return true;
}

double clac_area(P a, P b, P c){
	double aa = abs(a-b), bb = abs(b-c), cc = abs(c-a);
	double s = (aa + bb + cc) / 2;
	return sqrt(s * (s-aa) * (s-bb) * (s-cc));
}


void mainmain(){
	double a,b,c,d;
	while(cin>>a>>b>>c>>d){
		if(a==b&&b==c&&c==d&&a==0){
			return;
		}
		vector<S> v(3);
		v[0] = {P(a,b),P(c,d)};
		cin>>a>>b>>c>>d;
		v[1] = {P(a,b),P(c,d)};
		cin>>a>>b>>c>>d;
		v[2] = {P(a,b),P(c,d)};
		bool ok = true;
		rep(i,3){
			ok &= is_intersected(v[i], v[(i+1)%3]);
		}
		if(!ok){
			cout<<"kyo"<<endl;
			continue;
		}
		vector<P> w(3);
		rep(i,3){
			w[i] = intersection_ls(v[i].F, v[i].S, v[(i+1)%3].F, v[(i+1)%3].S);
		}
		rep(i,2){
			if(EQV(w[i], w[i+1])){
				ok = false;
			}
		}
		if(!ok){
			cout<<"kyo"<<endl;
			continue;
		}
		double ans = clac_area(w[0], w[1], w[2]);
		// cout<<ans<<endl;
		string s[] = {"dai-kichi", "chu-kichi", "kichi", "syo-kichi", "kyo"};
		double sigma[] = {1900000.0, 1000000.0, 100000.0, 0};
		rep(i,4){
			if(ans >= sigma[i]){
				cout<<s[i]<<endl;
				break;
			}
			if(i==3){
				cout<<s[4]<<endl;
			}
		}
	}
}


signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(20);
    mainmain();
}