#include <bits/stdc++.h>
using namespace std;

#define INF 1e99
#define EPS 1e-7

typedef complex<double> point;
typedef const point &ppoint;

double cross(ppoint a, ppoint b) {
	return a.real() * b.imag() - a.imag() * b.real();
}

double intersect(point pa1, point pa2, point pb1, point pb2) {
	point difa = pa2 - pa1;
	point difb = pb2 - pb1;
	point difab1 = pb1 - pa1;

	double D = cross(difa, -difb);

	if (abs(D) > EPS) {
		double t = cross(difab1, -difb) / D;
		double s = cross(difa, difab1) / D;

		if (t >= 0.0 && t <= 1.0 && s >= 0.0 && s <= 1.0) {
			return t;
		}
	}
	return INF;
}

int main() {
	point s[3], f[3], z[3];
	int x1, x2, y1, y2;

	while (true) {
		for (int i = 0; i < 3; ++i) {
			if (scanf("%d%d%d%d", &x1, &y1, &x2, &y2) != 4) {
				return 0;
			}
			s[i] = point(x1, y1);
			f[i] = point(x2, y2);
		}

		int j;
		for (j = 0; j < 3; ++j) {
			double t = intersect(s[j], f[j], s[(j + 1) % 3], f[(j + 1) % 3]);
			if (t == INF) {
				puts("kyo");
				break;
			}

			z[j] = (1.0 - t) * s[j] + t * f[j];
		}

		if (j == 3) {
			double s = abs(cross(z[1] - z[0], z[2] - z[0])) * 0.5;

			if (s >= 1.9e6) {
				puts("dai-kichi");
			} else if (s >= 1e6) {
				puts("chu-kichi");
			} else if (s >= 1e5) {
				puts("kichi");
			} else if (s > EPS) {
				puts("syo-kichi");
			} else {
				puts("kyo");
			}
		}
	}
}