#include <cstdio>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <iostream>
#include <cstring>
#include <string>
#include <cassert>
#include <cmath>
#include <cstdlib>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> PII;

#define pb push_back
#define fi first
#define se second

int limit[] = {0,31,28,31,30,31,30,31,31,30,31,30,31};

int main()
{
	while(1)
	{
		limit[2]=28;
		char buf[20];
		scanf("%s", buf);
		if(buf[0]=='e')
		{
			break;
		}
		bool v = true;
		if(strlen(buf)<10 || strlen(buf)>11)
		{
			printf("invalid\n");
			continue;
		}
		bool g = true;
		for(int i = 0; buf[i]; i++){
			if(buf[i]=='/' && i != 6) g = false;
			if(i==6 && buf[i]!='/') g = false;
		}
		if(!g)
		{
			printf("invalid2\n");
			continue;
		}
		char y[3];
		y[0]=buf[0]; y[1]=buf[1]; y[2]=0;
		int yy = atoi(y);
		bool c = false;
		if(yy%4==0) limit[2]++;
		if(yy >= 20 && yy <= 53)
		{
			if(strlen(buf)==11)
			{
				printf("invalid\n");
				continue;
			}
		}
		else if(yy <= 9 || yy >= 54)
		{
			c = true;
			if(strlen(buf)==10)
			{
				printf("invalid\n");
				continue;
			}
		}
		else{
			printf("invalid\n");
			continue;
		}
		y[0]=buf[2]; y[1]=buf[3];
		yy = atoi(y);
		bool b;
		int m = 0;
		if(yy >= 1 && yy <= 12){
			b = true;
			m = yy;
		}
		else if(yy >= 51 && yy <= 62)
		{
			b = false;
			m = yy-50;
		}
		else
			v = false;
		y[0]=buf[4]; y[1]=buf[5];	
		yy = atoi(y);
//		printf("den %d mesiac %d\n", yy, m);
		if(yy==0 || yy > limit[m]) v = false;
		long long sum;
		char buf2[20];
		for(int i = 0; buf[i]; i++)
			if(i < 6)
				buf2[i]=buf[i];
			else if(i>6)
				buf2[i-1]=buf[i];
		buf2[strlen(buf)]=0;
		sscanf(buf2, "%Ld", &sum);
		if(sum%11!=0 && c) v = false;
		if(!v)
			printf("invalid\n");
		else{
			if(b)
				printf("boy\n");
			else
				printf("girl\n");
		}
	}
	return 0;
}