#define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>
#include <ctime>

using namespace std;

typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 30;
const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;
const int CLK = CLOCKS_PER_SEC;

#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, m, n) for(int i = m; i < n; i++)

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

double dot(const xy_t &a, const xy_t &b){
	return real(conj(a)*b);
}

int ccw(xy_t a, xy_t b, xy_t c){
	b -= a, c -= a;
	if(cross(b, c) < 0) return 1;
	if(cross(b, c) > 0) return -1;
	if(dot(b, c) < 0) return 2;
	if(norm(b) < norm(c)) return -2;
	return 0;
}

bool intersectSS(const line &s, const line &t){
	return ccw(s.first, s.second, t.first) * ccw(s.first, s.second, t.second) <= 0
		&& ccw(t.first, t.second, s.first) * ccw(t.first, t.second, s.second) <= 0;
}

xy_t crosspoint(const line &l, const line &m){
	double a = cross(l.second - l.first, m.second - m.first);
	double b = cross(l.second - l.first, l.second - m.first);
	if(abs(a) < EPS && abs(b) < EPS) return m.first;
	if(abs(a) < EPS) assert(false);
	return m.first + b / a * (m.second - m.first);
}

int main(){
	line ls[3];
	xy_t p[3];
	int x1, y1, x2, y2;
	while(cin >> x1 >> y1 >> x2 >> y2 && (x1 || y1 || x2 || y2)){
		ls[0] = line(xy_t(x1, y1), xy_t(x2, y2));
		rep2(i, 1, 3) {
			cin >> x1 >> y1 >> x2 >> y2;
			ls[i] = line(xy_t(x1, y1), xy_t(x2,y2));
		}
		bool ok = true;
		rep(i, 3) if(!intersectSS(ls[i], ls[(i+1)%3])) ok = false;
		if(!ok) {
			cout << "kyo" << endl;
		}else{
			rep(i, 3) p[i] = crosspoint(ls[i], ls[(i+1)%3]);
			double area = abs(cross(p[2] - p[0], p[1] - p[0])) / 2;
			if(area < EPS){
				cout << "kyo" << endl;
			}else if(area < 100000){
				cout << "syo-kichi" << endl;
			}else if(area < 1000000){
				cout << "kichi" << endl;
			}else if(area < 1900000){
				cout << "chu-kichi" << endl;
			}else{
				cout << "dai-kichi" << endl;
			}
		}
	}
	return 0;
}