#include <vector>
#include <iostream>
#include <set>
#include <cstdio>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <tuple>
#include <algorithm>
#include <limits>
#include <map>
#include <complex>
using namespace std;
typedef long long ll;

const double EPS = 1e-9;

typedef complex<double> P;
struct L {
    P x, y;
    L() {};
    L(P a, P b) {x=a, y=b;};
};

namespace std {
    bool operator < (P a, P b) {
        return real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b);
    }
}

double cross(P a, P b) { return imag(conj(a)*b); }
double dot(P a, P b) { return real(conj(a)*b); }

int ccw(P a, P b, P 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 insLL(L &l, L &m) {
    if (abs(cross(l.y-l.x, m.y-m.x)) > EPS) return true;
    if (abs(cross(l.y-l.x, m.y-l.x)) < EPS) return true;
    return false;
}

bool insLS(L &l, L &s) {
    double a = cross(l.y-l.x, s.x-l.x);
    double b = cross(l.y-l.x, s.y-l.x);
    if (a*b < EPS) return true;
    return false;
}

bool insSP(L &s, P &p) {
    return abs(s.x-p)+abs(s.y-p)+abs(s.y-s.x) < EPS;
}

bool insSS(L &s, L &t) {
    int a = ccw(s.x,s.y,t.x), b = ccw(s.x,s.y,t.y);
    int c = ccw(t.x,t.y,s.x), d = ccw(t.x,t.y,s.y);
    if (a*b <= 0 && c*d <= 0) return true;
    return false;
}

P crossp(L &l, L &m) {
    double A = cross(l.y-l.x, m.y-m.x);
    double B = cross(l.y-l.x, l.y-m.x);
    if (abs(A) < EPS && abs(B) < EPS) return m.x;
    return m.x+B/A*(m.y-m.x);
}

int main() {
    while (true) {
        L l1, l2, l3;
        int x1, y1, x2, y2;
        cin >> x1 >> y1 >> x2 >> y2;
        if (!x1 && !y1 && !x2 && !y2) break;
        l1.x = P(x1, y1); l1.y = P(x2, y2);
        cin >> x1 >> y1 >> x2 >> y2;
        l2.x = P(x1, y1); l2.y = P(x2, y2);
        cin >> x1 >> y1 >> x2 >> y2;
        l3.x = P(x1, y1); l3.y = P(x2, y2);
        P p1 = crossp(l1, l2);
        P p2 = crossp(l2, l3);
        P p3 = crossp(l3, l1);
        double s = abs(cross(p2-p1, p3-p1))/2;
        if (!insSS(l1, l2) || !insSS(l2, l3) || !insSS(l3, l1)) s = 0;
        if (1900000 <= s) cout << "dai-kichi" << endl;
        else if (1000000 <= s) cout << "chu-kichi" << endl;
        else if (100000 <= s) cout << "kichi" << endl;
        else if (EPS <= s) cout << "syo-kichi" << endl;
        else cout << "kyo" << endl;
    }
}