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 <cmath>
  
#define EPS (1e-9)
  
using namespace std;
  
bool eq(double a, double b)
{
    return (fabs(b - a) <= EPS);
}
  
bool getP(int x1, int y1, int x2, int y2, int p1, int q1, int p2, int q2, double *r1, double *r2)
{
    int D = (x2 - x1) * (q2 - q1) - (y2 - y1) * (p2 - p1);
    if (D == 0) return (false);
      
    double r, s;
      
    r = ((q2 - q1) * (p1 - x1) - (p2 - p1) * (q1 - y1)) / (double)D;
    s = ((y2 - y1) * (p1 - x1) - (y2 - y1) * (q1 - y1)) / (double)D;
    //printf("%lf %lf\n", r, s);
    if (0 <= r + EPS && r - EPS <= 1 &&
        0 <= s + EPS && s - EPS <= 1){
        *r1 = x1 + r * (x2 - x1);
        *r2 = y1 + r * (y2 - y1);
        return (true);
    }
      
    return (false);
}
  
int main()
{
    int x1[3], y1[3], x2[3], y2[3];
    double x3[3], y3[3];
      
    while (1){
        for (int i = 0; i < 3; i++){
            scanf("%d %d %d %d", x1 + i, y1 + i, x2 + i, y2 + i);
            if (i == 0 && x1[i] == 0 && x2[i] == 0 && y1[i] == 0 && y2[i] == 0) return (0);
        }
          
        int k = 0;
        for (int i = 0; i < 3; i++){
            for (int j = i + 1; j < 3; j++){
                if (!getP(x1[i], y1[i], x2[i], y2[i],
                          x1[j], y1[j], x2[j], y2[j],
                          &x3[k], &y3[k])){
                          printf("kyo\n");
                          goto ng;
                }
                k++;
            }
        }
          
        for (int i = 0; i < 3; i++) for (int j = i + 1; j < 3; j++) if (eq(x3[i], x3[j]) && eq(y3[i], y3[j])){
            printf("kyo\n"); goto ng;
        }
        x3[0] -= x3[2]; x3[1] -= x3[2];
        y3[0] -= y3[2]; y3[1] -= y3[2];
          
        double S;
          
        S = 0.5 * fabs(x3[0] * y3[1] - y3[0] * x3[1]);
          
        if (eq(S, 0)) printf("kyo\n");
        else if (S + EPS >= 1900000) printf("dai-kichi\n");
        else if (S + EPS >= 1000000) printf("chu-kichi\n");
        else if (S + EPS >= 100000) printf("kichi\n");
        else printf("syo-kichi\n");
          
        ng:;
    }
      
    return (0);
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <complex>
#include <assert.h>

using namespace std;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

#define EPS (1e-7)

typedef complex<double> P;
struct Line : public vector<P>
{
  Line() {
  }
  Line(P a, P b) {
    push_back(a);
    push_back(b);
  }
};

double cross(P const& a, P const& b) {
  return imag(conj(a)*b);
}

bool is_cross_ss(Line const& a, Line const& b) {
  return ( cross(a[1]-a[0], b[0]-a[0]) * cross(a[1]-a[0], b[1]-a[0]) < EPS )
    && ( cross(b[1]-b[0], a[0]-b[0]) * cross(b[1]-b[0], a[1]-b[0]) < EPS );
}

P crosspoint_ss(Line const& a, Line const& b) {
  P vb = b[1]-b[0];
  double d1 = abs(cross(vb, a[0]-b[0]));
  double d2 = abs(cross(vb, a[1]-b[0]));
  double t = d1 / (d1+d2);
  return a[0] + (a[1]-a[0]) * t;
}

bool operator == (P const& a, P const& b) {
  return ( abs(a.real()-b.real()) < EPS && abs(a.imag()-b.imag()) < EPS );
}

int main() {
  
  while(1) {
    Line l[3];
    rep(i, 3) {
      double sx, sy, gx, gy;
      cin >> sx >> sy >> gx >> gy;
      if(i == 0 && sx == 0 && sy == 0 && gx == 0 && gy == 0) return 0;
      l[i] = Line(P(sx, sy), P(gx, gy));
    }
    
    
    vector<P> ps;
    rep(i, 3) {
      if(is_cross_ss(l[i], l[(i+1)%3])) {
        P cp = crosspoint_ss(l[i], l[(i+1)%3]);
        bool ok = 1;
        rep(j, (int)ps.size())
          if(ps[j] == cp) { ok = 0; }
        if(ok) {
          ps.push_back(cp);
        }
      }
    }
    
    if(ps.size() < 3) {
      cout << "kyo\n";
      continue;
    }
    if(ps.size() > 3) {
      assert(false && "sine");
    }
    
    double ans = abs(cross(ps[2]-ps[0], ps[1]-ps[0])) / 2.;
    if(ans >= 1900000.) {
      cout << "dai-kichi\n";
    }
    else if(ans >= 1000000.) {
      cout << "chu-kichi\n";
    }
    else if(ans >= 100000.) {
      cout << "kichi\n";
    }
    else if(ans > EPS) {
      cout << "syo-kichi\n";
    }
    else {
      cout << "kyo\n";
    }
  }
  
  return 0;
}