#include <iostream>
#include <algorithm>
using namespace std;
enum {noans,shai,da};
const int day[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
bool is_rn(int y){
if((y%400==0||y%4==0)&&y%100!=0)
return true;
return false;
}
int ans(int y,int m,int d){
if(y<0||(m<1||m>12)||d<1||d>day[m])
return noans;
int year=1990,yy=y;
if(y<year)
swap(year,yy);
int ans=0;
for(int i=year;i<yy;i++){
if(is_rn(i))
ans+=366;
else ans+=365;
}
int dd=0;
for(int i=1;i<m;i++){
if(i==2&&is_rn(y))
dd+=29;
else dd+=day[i];
}
dd+=d;
if(year==1990)ans+=dd;
else {if(!is_rn(y))ans+=365-dd;
else ans+=366-dd;
ans*=-1;
}
ans-=1;
ans=(ans%5+5)%5;
if(ans<3)return da;
else return shai;
}
int y,m,d;
int main(){
while(cin>>y>>m>>d){
switch(ans(y,m,d)){
case 0:cout<<"别开玩笑了23333"<<endl;break;
case 1:cout<<"晒网"<<endl;break;
case 2:cout<<"打鱼"<<endl;
}
}
}