#include<iostream>
#include<iomanip>
#include<cstdio>
#include<deque>
#include<cmath>
#include<cctype>
#include<algorithm>
#include<string>
using namespace std;
struct m {
	string name;
	int num;
};
deque<int>a;
bool cmp1 (int x, int y) {
	return x < y;
}
bool cmp (m x, m y) {
	return x.num > y.num;

}
int b[100005] = { 0 };
int main() {
	int t, i, j;
	int a[10000];
	a[0] = 1;
	a[1] = 1;
	for(i = 2; i <= 100000; i++) {
		a[2] = a[0] + a[1];
		if(a[2] > 100000)
			break;
		b[a[2]] = 1;
		a[0] = a[1];
		a[1] = a[2];
	}
	while(scanf("%d", &t) != EOF) {
		if(t == 1)
			printf("Bad Day");
		else if(t == 2)
			printf("Lucky Day");
		else {
			if(b[t]) {
				printf("Lucky Day");
			}
			else 
				printf("Bad Day");
		}
		printf("\n");
	}

	return 0;
}