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

struct point
{
    double x, y;
    point(double x, double y) : x(x), y(y){}
};

struct line
{
    point start, end;
    complex<double> v;
    line(point start, point end) : start(start), end(end)
    {
        v = complex<double>(end.x - start.x, end.y - start.y);
    }
};

bool is_cross(line l1, line l2)
{
    point a = l1.start;
    point b = l1.end;
    point c = l2.start;
    point d = l2.end;
    double ta = (c.x - d.x) * (a.y - c.y) + (c.y - d.y) * (c.x - a.x);
    double tb = (c.x - d.x) * (b.y - c.y) + (c.y - d.y) * (c.x - b.x);
    double tc = (a.x - b.x) * (c.y - a.y) + (a.y - b.y) * (a.x - c.x);
    double td = (a.x - b.x) * (d.y - a.y) + (a.y - b.y) * (a.x - d.x);

    return ta * tb < 0 and tc * td < 0;
}

point cross_point(line l1, line l2)
{
    point a = l1.start;
    point b = l1.end;
    point c = l2.start;
    point d = l2.end;
    double ksi, eta, delta;
    double lambda;

    ksi = (d.y - c.y) * (d.x - a.x) - (d.x - c.x) * (d.y - a.y);
    eta = (b.x - a.x) * (d.y - a.y) - (b.y - a.y) * (d.x - a.x);
    delta = (b.x - a.x) * (d.y - c.y) - (b.y - a.y) * (d.x - c.x);

    lambda = ksi / delta;

    return point(a.x + lambda * (b.x - a.x), a.y + lambda * (b.y - a.y));
}

double triangle_area(point p1, point p2, point p3)
{
    line a(p1, p2);
    line b(p2, p3);
    line c(p3, p1);
    double s = (abs(a.v) + abs(b.v) + abs(c.v)) / 2;
    return sqrt(s * (s - abs(a.v)) * (s - abs(b.v)) * (s - abs(c.v)));
}

int main(void)
{
    int x1, y1;
    int x2, y2;

    while (scanf("%d %d %d %d", &x1, &y1, &x2, &y2), x1 || y1 || x2 || y2){
        line l1(point(x1, y1), point(x2, y2));
        scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
        line l2(point(x1, y1), point(x2, y2));
        scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
        line l3(point(x1, y1), point(x2, y2));

        if (is_cross(l1, l2) and is_cross(l2, l3) and is_cross(l3, l1)){
            point p1 = cross_point(l1, l2);
            point p2 = cross_point(l2, l3);
            point p3 = cross_point(l3, l1);
            double area = triangle_area(p1, p2, p3);

            if (19e5 <= area) puts("dai-kichi");
            else if (1e6 <= area) puts("chu-kichi");
            else if (1e5 <= area) puts("kichi");
            else puts("syo-kichi");
        }
        else {
            puts("kyo");
        }
    }

    return 0;
}