#include <iostream>
#include <cmath>
using namespace std;

class Point {
public:
  double x;
  double y;
  Point(double x = 0, double y = 0) : x(x), y(y) {}
  Point operator +(Point p) { return Point(x+p.x, y+p.y); }
  Point operator -(Point p) { return Point(x-p.x, y-p.y); }
  Point operator *(double a) { return Point(x*a, y*a); }
};
typedef Point Vector;

double dot(Vector a, Vector b) {
  return a.x*b.x + a.y*b.y;
}

double cross(Vector a, Vector b) {
  return a.x*b.y - a.y*b.x;
}

double norm(Vector v) {
  return v.x*v.x + v.y*v.y;
}

double abs(Vector v) {
  return sqrt(norm(v));
}

class Segment {
public:
  Point p1;
  Point p2;
  Segment(Point p1=Point(0,0), Point p2=Point(0,0)) : p1(p1), p2(p2) {}
};
typedef Segment Line;

Point project(Segment s, Point p) {
  Vector base = s.p2 - s.p1;
  double t = dot(p - s.p1, base)/norm(base);
  return s.p1 + base*t;
}

int ccw(Point p0, Point p1, Point p2) {
  Vector a = p1 - p0;
  Vector b = p2 - p0;
  if(cross(a, b) > 0) return 1;
  if(cross(a, b) < 0) return -1;
  if(dot(a, b) < 0) return 2;
  if(norm(a) < norm(b)) return -2;
  return 0;
}

bool isIntersect(Point p1, Point p2, Point p3, Point p4) {
  return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
	  ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}

bool isIntersect(Segment s1, Segment s2) {
  return isIntersect(s1.p1, s1.p2, s2.p1, s2.p2);
}

Point getCrossPoint(Segment s1, Segment s2) {
  Vector base = s2.p2 - s2.p1;
  double d1 = abs(cross(base, s1.p1 - s2.p1));
  double d2 = abs(cross(base, s1.p2 - s2.p1));
  double t = d1/(d1+d2);
  return s1.p1 + (s1.p2-s1.p1)*t;
}

int main() {
  while(1) {
    Segment s[3];
    cin >> s[0].p1.x >> s[0].p1.y >> s[0].p2.x >> s[0].p2.y;
    if(s[0].p1.x == 0 && s[0].p1.y == 0 &&
       s[0].p2.x == 0 && s[0].p2.y == 0    ) break;
    for(int i = 1; i < 3; i++) {
      cin >> s[i].p1.x >> s[i].p1.y >> s[i].p2.x >> s[i].p2.y;
    }

    double S = -1;
    bool flag = true;
    for(int i = 0; i < 3; i++) {
      if(!isIntersect(s[i], s[(i+1)%3])) {
	flag = false;
	break;
      }
    }
    if(flag) {
    Point p[3];
    for(int i = 0; i < 3; i++) {
      p[i] = getCrossPoint(s[i], s[(i+1)%3]);
    }
    
    S = abs(p[1] - p[0]) * abs(project(Segment(p[0], p[1]), p[2]) - p[2]) / 2;
    }

    if(S >= 1900000) cout << "dai-kichi" << endl;
    else if(S >= 1000000) cout << "chu-kichi" << endl;
    else if(S >= 100000) cout << "kichi" << endl;
    else if(S > 0) cout << "syo-kichi" << endl;
    else cout << "kyo" << endl;
  }
  return 0;
}