#include<cstdio>
#include<iostream>
#include<algorithm>
#include<queue>
#include<string>
#include<vector>
#include<deque>
#include<set>
#include<map>

using namespace std;

#define PB push_back()
#define SZ(x) ((int)x.size())
#define PI 3.141592653589
#define REP(i,N) for(int(i)=0;(i)<(int)(N);++(i))

int days[13]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int daysp[13]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int pred=1900;

inline bool ispres(int r)
{
	if(r<10) r+=2000;
	else r+=1900;
	int res=0;
	if(r%4==0) res=1;
	if(r%100==0) res=0;
	if(r%400==0) res=1;
 return res;
}

inline bool testr(int r, int m, int d)
{
	return 1;
}

inline bool testm(int r, int m, int d)
{
	if(m>0 && m<13) return 1;
	return 0;
}

inline bool testd(int r, int m, int d)
{
	if(d==0) return 0;
	if(ispres(r) && daysp[m]<d) return 0;
	else if(!ispres(r) && days[m]<d) return 0;
	return 1;	
}

bool doover(string s,int r, int m, int d)
{
	if(s[6]!='/') return 0;
	if (r<20&&r>9) return 0;
	if(s.size()==10 && r>53) return 0;
	if((r<54&&r>10) && s.size()==11) return 0;
	long long c = ((long long)(r*10000+m*100+d));
	for(int i=7;i<s.size();i++)
		if(s[i]=='/') return 0;
		else 
		{
			c*=10;
			c+=s[i]-'0';
		}
//	cout<<"C : "<<c%11<<endl;
if(s.size()==10) return 1;
	if(c%11==0) return 1;
	return 0;
}

string over(string d)
{
	REP(i,6)
		if(d[i]=='/')
			return 0;
	int rr=(d[0]-'0')*10+(d[1]-'0');
	int mm=(d[2]-'0')*10+(d[3]-'0');
	int dd=(d[4]-'0')*10+(d[5]-'0');
//	cout<<rr<<" "<<mm<<" "<<dd<<endl;
	int mm2=mm;
	if(mm2>12)mm2-=50;
		
//	cout<<testr(rr,mm2,dd)<<" "<< testm(rr,mm2,dd) <<" "<< testd(rr,mm2,dd) <<" "<< doover(d,rr,mm,dd)<<endl;
	if(testr(rr,mm2,dd) && testm(rr,mm2,dd) && testd(rr,mm2,dd) && doover(d,rr,mm,dd))
	{
			if(mm>12) return "girl";
			return "boy";
	}
	else
		return "invalid";
}

inline string kto(string s)
{
	int sz = s.size();
	if(sz==10 || sz==11)
	{
	 if(sz==10) pred=1900;
	 if(sz==11) pred=2000;	 
	 return over(s);
	}
	else	
	 return "invalid";
}

int main()
{
	string s;
	while(cin>>s,s!="end")
	{
		cout<<kto(s)<<endl;
	}
	return 0;
}