Start: Jul, 10, 2019 08:30:00
2019年度暑期短学期达标测试补考
End: Jul, 10, 2019 11:30:00
Time elapsed:
Time remaining:

Problem_ID: E
Result: Accepted
Time: 44ms
Memory: 2800kB
Author: 2018212212136
In contest: 1284

#include<bits/stdc++.h>
using namespace std;

long long int a[100010];

int init()
{
	long long int last = 100010;
	a[0] = a[1] = 1;
	long long int i;
	for(i = 2;a[i] < last;++i)
	{
		a[i] = a[i-2]+a[i-1];
	}	
	return i;
}

int isfind(int n,int sum)
{
	for(int i = 1;i < sum;++i)
	{
		if(n == a[i])
			return 1;
	}
	return 0;
}
int main()
{
	long long int n;
	while(scanf("%lld",&n) != EOF)
	{
		int sum = init();
		if(isfind(n,sum)==1)
			printf("Lucky Day\n");
		else
			printf("Bad Day\n");
	}
}