
#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <string>
#include <cmath>

using namespace std;

const double EPS=1e-9;

namespace FP {
    bool isZero(double x) {
        return (abs(x) <= EPS);
    }
};

struct Point {
    double x, y;
    Point(double x=0, double y=0) : x(x), y(y) {}
    string to_s() {
        ostringstream os;
        os << "(" << x << "," << y << ")";
        return os.str();
    }
    bool operator<(const Point &o) const {
        return x == o.x ? y < o.y : x < o.x;
    }
    bool operator==(const Point &o) const {
        return x == o.x && y == o.y;
    }
    Point operator+(const Point &o) const {
        return Point(x+o.x, y+o.y);
    }
    Point operator-(const Point &o) const {
        return Point(x-o.x, y-o.y);
    }
    Point operator*(const double m) const {
        return Point(x*m, y*m);
    }
    Point operator/(const double d) const {
        return Point(x/d, y/d);
    }
    // 外積
    double cross(const Point &o) const {
        return x * o.y - y * o.x;
    }
    // 内積
    double dot(const Point &o) const {
        return x * o.x + y * o.y;
    }
    // ベクトルがx軸となす角
    double atan() const {
        return atan2(y, x);
    }
    // ベクトルの長さの二乗
    double norm() const {
        return dot(*this);
    }
};

struct Line {
    double a, b, c;
    Line(double a=0, double b=0, double c=0) :
        a(a), b(b), c(c) {}
    Point intersectionPoint(const Line &l) const {
        double d = a * l.b - l.a * b;
        if (!intersects(l)) {
            throw string("The 2 Lines are parallel");
        }
        double x = (b * l.c - l.b * c) / d;
        double y = (l.a * c - a * l.c) / d;
        return Point(x, y);
    }
    bool intersects(const Line &l) const {
        return !FP::isZero(a * l.b - l.a * b);
    }
    string to_s() {
        ostringstream os;
        os << a << ' ' << b << ' ' << c;
        return os.str();
    }
    static Line fromPoints(const Point &a, const Point &b) {
        double dx = b.x - a.x;
        double dy = b.y - a.y;
        return Line(dy, -dx, dx * a.y - dy * a.x);
    }
    static Line fromPoints(double x1, double y1, double x2, double y2) {
        return fromPoints(Point(x1, y1), Point(x2, y2));
    }
};

struct LineSegment {
    Point start, end;
    LineSegment(const Point &start, const Point &end) : start(start), end(end) {}
    LineSegment(double x1=0, double y1=0, double x2=0, double y2=0) : start(Point(x1, y1)), end(Point(x2, y2)) {}
    string to_s() {
        ostringstream os;
        os << '(' << start.x << ',' << start.y << ')' << '-' << '(' << end.x << ',' << end.y << ')' << endl;
        return os.str();
    }
    Line toLine() const {
        return Line::fromPoints(start, end);
    }
    bool intersects(const Line &l) const {
        double t1 = l.a * start.x + l.b * start.y + l.c;
        double t2 = l.a * end.x + l.b * end.y + l.c;
        return t1 * t2 <= 0;
    }
    bool intersects(const LineSegment &s) const {
        return intersects(s.toLine()) && s.intersects(toLine());
    }
    Point intersectionPoint(const LineSegment &s) const {
        if (!intersects(s)) {
            throw "The 2 line segments are parallel";
        }
        return (toLine().intersectionPoint(s.toLine()));
    }
};

int main() {
    Point s, e;
    while (cin >> s.x >> s.y >> e.x >> e.y) {
        if (s.x == 0 && s.y == 0 && e.x == 0 && e.y == 0) break;

        LineSegment seg[3];
        seg[0] = LineSegment(s, e);
        for (int i = 1; i < 3; i++) {
            cin >> s.x >> s.y >> e.x >> e.y;
            seg[i] = LineSegment(s, e);
        }

        if (!seg[0].intersects(seg[1]) || !seg[1].intersects(seg[2])
                                       || !seg[2].intersects(seg[0])) {
            cout << "kyo" << endl;
            break;
        }

        Point vertex[3];
        vertex[0] = seg[0].intersectionPoint(seg[1]);
        vertex[1] = seg[1].intersectionPoint(seg[2]);
        vertex[2] = seg[2].intersectionPoint(seg[0]);
        if (vertex[0] == vertex[1] && vertex[1] == vertex[2]) {
            cout << "kyo" << endl;
            break;
        }
        
        double area = abs((vertex[1] - vertex[0]).cross(vertex[2] - vertex[0]) / 2.0);
//        cout << area << endl;
        if (area - 100000 < EPS) {
            cout << "syo-kichi" << endl;
        } else if (area - 1000000 < EPS) {
            cout << "kichi" << endl;
        } else if (area - 1900000 < EPS) {
            cout << "chu-kichi" << endl;
        } else {
            cout << "dai-kichi" << endl;
        }
    }
    return 0;
}