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 <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <queue>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
const double EPS = 1e-8;
const double INF = 1e12;
typedef complex<double> P;
namespace std {
  bool operator < (const P& a, const P& b) {
    return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
  }
}
double cross(const P& a, const P& b) {
  return imag(conj(a)*b);
}
double dot(const P& a, const P& b) {
  return real(conj(a)*b);
}

struct L : public vector<P> {
  L(){}
  L(const P &a, const P &b) {
    push_back(a); push_back(b);
  }
};
int ccw(P a, P b, P c) {
  b -= a; c -= a;
  if (cross(b, c) > 0)   return +1;       // counter clockwise
  if (cross(b, c) < 0)   return -1;       // clockwise
  if (dot(b, c) < 0)     return +2;       // c--a--b on line
  if (norm(b) < norm(c)) return -2;       // a--b--c on line
  return 0;
}
bool intersectSS(const L &s, const L &t) {
  return ccw(s[0],s[1],t[0])*ccw(s[0],s[1],t[1]) <= 0 &&
         ccw(t[0],t[1],s[0])*ccw(t[0],t[1],s[1]) <= 0;
}
bool sameline(const L &l, const L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  return (abs(A) < EPS && abs(B) < EPS) ; // same line
}
P crosspoint(const L &l, const L &m) {
  double A = cross(l[1] - l[0], m[1] - m[0]);
  double B = cross(l[1] - l[0], l[1] - m[0]);
  if (abs(A) < EPS && abs(B) < EPS) return m[0]; // same line
  return m[0] + B / A * (m[1] - m[0]);
}

int main() {
  while(1) {
    L ls[3];
    bool fff = 0;
    REP(i,3) {
      int x1,y1,x2,y2;
      cin >> x1 >> y1 >> x2 >> y2;
      if (!x1&&!y1&&!x2&&!y2) {
        fff = 1;
        break;
      }
      ls[i] = L(P(x1,y1), P(x2,y2));
    }
    if (fff) break;
    
    if (!intersectSS(ls[0], ls[1]) || !intersectSS(ls[1], ls[2]) || !intersectSS(ls[2],ls[0])
        ||sameline(ls[0], ls[1]) ||sameline(ls[1], ls[2]) || sameline(ls[2], ls[0])) {
      cout << "kyo" << endl;
      continue;
    }
    P cp[3];
    REP(i,3) {
      cp[i] = crosspoint(ls[i], ls[(i+1)%3]);
//      cout << cp[i] << endl;
    }
    double S = abs(cross(cp[2]-cp[0], cp[1]-cp[0])) / 2;

//    cout << S << endl;
    if (S >= 1900000) cout << "dai-kichi" << endl;
    else if (S >= 1000000) cout << "chu-kichi" << endl;
    else if (S >= 100000) cout << "kichi" << endl;
    else if (S > EPS) cout << "syo-kichi" << endl;
    else cout << "kyo" << endl;
  }
}

C++: #include<iostream>
#include<complex>
#define EPS 1e-10
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQP(a,b) (EQ((a).real(),(b).real()) && EQ((a).imag(),(b).imag()))
using namespace std;

typedef complex<double> P;

double dot(P a,P b){return real(conj(a)*b);}
double cross(P a,P b){return imag(conj(a)*b);}
double area(P a,P b,P c){return abs(cross(b-a,c-a)/2);}
bool para(P a1,P a2,P b1,P b2){return abs(cross(a1-a2,b1-b2))<EPS;}
bool is_cp(P a1,P a2,P b1,P b2){
  if(cross(a2-a1,b1-a1) * cross(a2-a1,b2-a1) < EPS)
    if(cross(b2-b1,a1-b1) * cross(b2-b1,a2-b1) < EPS)return true;
  return false;
}
P seg_cp(P a1,P a2,P b1,P b2){
  b2-=b1;
  double d = abs(cross(b2,a1-b1));
  return a1 + (a2-a1)*d/( d + abs(cross(b2,a2-b1)) );
}

int main(){
  P p11,p12,p21,p22,p31,p32;

  for(;;){
    cin >> p11.real() >> p11.imag() >> p12.real() >> p12.imag();
    if(!abs(p11) && !abs(p12))break;
    cin >> p21.real() >> p21.imag() >> p22.real() >> p22.imag();
    cin >> p31.real() >> p31.imag() >> p32.real() >> p32.imag();

    if(para(p11,p12,p21,p22) || para(p21,p22,p31,p32) || para(p31,p32,p11,p12))
      cout << "kyo\n";
    else if(!is_cp(p11,p12,p21,p22) || !is_cp(p21,p22,p31,p32) || !is_cp(p31,p32,p11,p12))
      cout << "kyo\n";
    else{
      P cp1 = seg_cp(p11,p12,p21,p22);
      P cp2 = seg_cp(p21,p22,p31,p32);
      P cp3 = seg_cp(p31,p32,p11,p12);
      if(EQP(cp1,cp2))cout << "kyo\n";
      else{
	double s = area(cp1,cp2,cp3);
	if(s+EPS>1900000)cout << "dai-kichi\n";
	else if(s+EPS>1000000)cout << "chu-kichi\n";
	else if(s+EPS>100000)cout << "kichi\n";
	else cout << "syo-kichi\n";
      }
    }
    
  }
}