#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<cassert>
#include<iostream>
#include<sstream>
#include<string>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<utility>
#include<numeric>
#include<algorithm>
#include<bitset>
#include<complex>
#include<stack>

using namespace std;

typedef long long Int;
typedef vector<int> vint;
typedef pair<int,int> pint;
typedef vector<string> vstring;
typedef vector<pint> vpint;
typedef stringstream SS;

struct Edge{int to,from,cost;};

#ifdef DEBUG
#define debug cout
#else
SS ss;
#define debug ss
#endif

template<class T> void chmin(T &t, T f) { if (t > f) t = f; }
template<class T> void chmax(T &t, T f) { if (t < f) t = f; }
int in() { int x; scanf("%d", &x); return x; }

#define rep(i,n) for(int i=0;i<(n);++i)
#define repn(i,m,n) for(int i=(m);i<=(n);++i)
#define repd(i,n) for(int i=(n)-1;i>=0;--i)
#define repnd(i,m,n) for(int i=(n);i>=(m);--i)
#define rep0(i,n) for(i=0;i<(n);++i)
#define repn0(i,m,n) for(i=(m);i<=(n);++i)
#define repd0(i,n) for(i=(n)-1;i>=0;--i)
#define repnd0(i,m,n) for(i=(n);i>=(m);--i)
#define all(n) n.begin(),n.end()
#define sz(n) ((int)(n).size())
#define IL for(;;)
#define MP make_pair
#define PB push_back
#define X second
#define Y first
#define PUTLINE debug<<"LINE:"<<__LINE__<<endl;

const int INF = 2147483647/3;
const double EPS = 1e-10;
const double PI = acos(-1.0);

const int dx[]={1,-1,0,0,1,-1,1,-1,0};
const int dy[]={0,0,1,-1,1,-1,-1,1,0};

int sig(double r){return (r<-EPS)?-1:(r>EPS)?1:0;}
struct Pt{
	double x,y;
	Pt(){}
	Pt(double x,double y) : x(x),y(y){}
	Pt operator+(const Pt &a)const{return Pt(x+a.x,y+a.y);}
	Pt operator-(const Pt &a)const{return Pt(x-a.x,y-a.y);}
	Pt operator*(const Pt &a)const{return Pt(x*a.x-y*a.y,x*a.y+y*a.x);}
	Pt operator-()const{return Pt(-x,-y);}
	Pt operator*(const double &k)const{return Pt(x*k,y*k);}
	Pt operator/(const double &k)const{return Pt(x/k,y/k);}
	double abs()const{return sqrt(x*x+y*y);}
	double abs2()const{return x*x+y*y;}
	double arg()const{return atan2(y,x);}
	double dot(const Pt &a)const{return x*a.x+y*a.y;}
	double det(const Pt &a)const{return x*a.y-y*a.x;}
	bool operator<(const Pt &a)const{return (x!=a.x)?(x<a.x):(y<a.y);}
	bool operator==(const Pt &a)const{return (sig(x-a.x)==0&&sig(y-a.y)==0);}
};
ostream &operator<<(ostream &os,const Pt &a){os<<"("<<a.x<<", "<<a.y<<")";return os;}
double tri(Pt a,Pt b,Pt c){return (b-a).det(c-a);}

Pt proj(Pt a,Pt b){return a*a.dot(b)/a.abs2();}
Pt perp(Pt a,Pt b,Pt c){return a+proj(b-a,c-a);}
Pt refl(Pt a,Pt b,Pt c){return perp(a,b,c)*2-c;}

int iSP(Pt a,Pt b,Pt c){
	int s=sig((b-a).det(c-a));
	if(s)return s;
	if(sig((b-a).dot(c-a))<0)return -2;
	if(sig((a-b).dot(c-b))<0)return +2;
	return 0;
}

int iLL(Pt a,Pt b,Pt c,Pt d){
	if(sig((b-a).det(d-c)))return 1;
	if(sig((b-a).det(c-a)))return 0;
	return -1;
}

bool iSS(Pt a,Pt b,Pt c,Pt d){
	return (iSP(a,b,c)*iSP(a,b,d)<=0&&iSP(c,d,a)*iSP(c,d,b)<=0);
}

Pt pLL(Pt a,Pt b,Pt c, Pt d){
	b=b-a;d=d-c;
	return a+b*(c-a).det(d)/b.det(d);
}

int main() {
	Pt p[3][2];
	IL{
		cin>>p[0][0].x>>p[0][0].y;
		cin>>p[0][1].x>>p[0][1].y;
		if(p[0][0].abs()+p[0][1].abs()==0)break;
		cin>>p[1][0].x>>p[1][0].y;
		cin>>p[1][1].x>>p[1][1].y;
		cin>>p[2][0].x>>p[2][0].y;
		cin>>p[2][1].x>>p[2][1].y;
		bool ok=true;
		rep(i,3){
			if(!iSS(p[i][0],p[i][1],p[(i+1)%3][0],p[(i+1)%3][1])
				||iLL(p[i][0],p[i][1],p[(i+1)%3][0],p[(i+1)%3][1])<1){
				ok=false;
				break;
			}
		}
		if(!ok){
			cout<<"kyo\n";
		}else{
			Pt a,b,c;
			a=pLL(p[0][0],p[0][1],p[1][0],p[1][1]);
			b=pLL(p[1][0],p[1][1],p[2][0],p[2][1]);
			c=pLL(p[2][0],p[2][1],p[0][0],p[0][1]);
//debug<<a<<endl;
//debug<<b<<endl;
//debug<<c<<endl;
			double s=abs(tri(a,b,c))/2;
//debug<<s<<endl;
			if(s>=1900000){
				cout<<"dai-kichi\n";
			}else if(s>=1000000){
				cout<<"chu-kichi\n";
			}else if(s>=100000){
				cout<<"kichi\n";
			}else if(s>0){
				cout<<"syo-kichi\n";
			}else{
				cout<<"kyo\n";
			}
		}
	}
	return 0;
}