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

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define EPS 1e-8

using namespace std;

struct Point 
{
    double x, y;
    Point(double x=0, double y=0) : x(x), y(y) {}
    
	double distance (const Point &o) const 
	{
        return sqrt((x - o.x) * (x - o.x) + (y - o.y) * (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;
    }
 
    double atan() const 
	{
        return atan2(y, x);
    }

    double norm() const 
	{
        return sqrt(dot(*this));
    }

	double area_abs(const Point &a,const Point &b) const
	{
		double t = (a.x - x) * (b.y - y);
		double t2 = (a.y - y) * (b.x - x);
		double areas = abs(t-t2);
		return areas/2;
	}

	//符号付き面積
	double area(const Point &a,const Point &b)
	{
		return ((a.x - x) * (b.y - y)) + ((b.x - x) * (y - a.y));
	}
	//線分abが自身の含まれているのかどうか判断する
	int between(const Point &a,const Point &b)
	{
		if(area(a,b) != 0) return 0;

		if(a.x != b.x)
		{
			return ((a.x <= x) && (x <= b.x) || (a.x >= x) && (x >= b.x));
		}
		else
		{
			return ((a.y <= y) && (y <= b.y) || (a.y >= y) && (y >= b.y));
		}
	}

	double distance_seg(const Point& a,const Point& b)
	{
		if((b-a).dot(*this-a) < EPS) 
		{
			return (*this-a).norm();
		}
		if((a-b).dot(*this-b) < EPS)
		{
			return (*this-b).norm();
		}
		return abs((b-a).cross(*this-a)) / (b-a).norm();
	}

	//点a,b,cからなる三角形の中に自身が含まれているかどうか
	bool hitPolygon(const Point& a,const Point& b,const Point& c)
	{
		double t = (b-a).cross(*this-b);
		double t2 = (c-b).cross(*this-c);
		double t3 = (a-c).cross(*this-a);
		
		if((t > 0 && t2 > 0 && t3 > 0) || ( t < 0 && t2 < 0 && t3 < 0))
		{
			return 1;
		}

		return 0;
	}
};

struct Seg
{
	Point a,b;

	Seg (Point a, Point b) : a(a),b(b) {}

	bool isIntersect(Seg &s)
	{
		return ((a-b).cross(s.a-a) * (a-b).cross(s.b-a) < EPS) && ((s.b-s.a).cross(a-s.a)*(s.b-s.a).cross(b-s.a) < EPS);
	}

	Point getCrossPoint(Seg &s)
	{
		Point p = a - s.a;
		double temp = (b.x - a.x) * (s.b.y - s.a.y) - (b.y - a.y) * (s.b.x - s.a.x);
		
		if(fabs(temp) > EPS)
		{
			double r = ((s.b.y - s.a.y) * p.x - (s.b.x - s.a.y) * p.y) / temp;
			double s = ((b.y - a.y) * p.x - (b.x - a.x) * p.y) / temp;

			p.x = a.x + r * (b.x - a.x);
			p.y = a.y + r * (b.y - a.y);
		}

		return p;	
	}
};

int main()
{
	double x1,y1,x2,y2,x3,y3;
	while(cin >> x1 >> y1 >> x2 >> y2)
	{
		if(x1 == 0 && y1 == 0 && x2 == 0 && y2 == 0) break;
		
		vector<Seg> v;

		v.push_back(Seg(Point(x1,y1),Point(x2,y2)));

		rep(i,2)
		{
			cin >> x1 >> y1 >> x2 >> y2;
			v.push_back(Seg(Point(x1,y1),Point(x2,y2)));
		}
		
		bool flag = false;

		if(!v[0].isIntersect(v[1])) flag = true;
		if(!v[1].isIntersect(v[2])) flag = true;
		if(!v[2].isIntersect(v[0])) flag = true;

		if(flag) cout << "kyo" << endl;
		else
		{
			Point p1 = v[0].getCrossPoint(v[1]);
			Point p2 = v[1].getCrossPoint(v[2]);
			Point p3 = v[2].getCrossPoint(v[0]);

			double ans = p1.area_abs(p2,p3);

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

		}
	}
	return 0;
}