#include <cstdio>
#include <iostream>
#include<algorithm>
#include<map>
using namespace std;
int n,m,i,j,k;
int f[114];
map<int,int>ff;
int main()
{
	f[0]=f[1]=1;
	ff[1]=1;
	for(i=2;i<=100;++i)
	{
		f[i]=f[i-1]+f[i-2];
		ff[f[i]]=1;
	}
	while(~scanf("%d",&n)){
		if(ff[n])
			puts("Lucky Day");
		else
			puts("Bad Day");
	}
	return 0;
}