# Rest in peace – 21-1! | Hackerearth practice problem solution

__ Problem:-__

The grandest stage of all, Wrestlemania XXX recently happened. And with it, happened one of the biggest heartbreaks for the WWE fans around the world. The Undertaker’s undefeated streak was finally over.

Now as an Undertaker fan, you’re disappointed, disheartened and shattered to pieces. And Little Jhool doesn’t want to upset you in any way possible. (After all you are his only friend, true friend!) Little Jhool knows that you’re still sensitive to the loss, so he decides to help you out.

Every time you come across a number, Little Jhool carefully manipulates it. He doesn’t want you to face numbers which have “21” as a part of them. Or, in the worst case possible, are divisible by 21.

If you end up facing such a number you feel sad… and no one wants that – because you start chanting “The streak is broken!” , if the number doesn’t make you feel sad, you say, “The streak lives still in our heart!”

Help Little Jhool so that he can help you!

Input Format:

The first line contains a number, *t*, denoting the number of test cases.

After that, for *t* lines there is one number in every line.

Output Format:

Print the required string, depending on how the number will make you feel.

Constraints:

1 ≤ t ≤ 100

1 ≤ n ≤ 1000000

__Code:-__

__Recommended post:-__

__Hackerearth Problems:-__

- Very Cool numbers | Hacker earth solution
- Birthday party | Hacker earth solution
- Most frequent | hacker earth problem solution
- program to find symetric difference of two sets
- cost of balloons | Hacker earth problem solution
- Chacha o chacha | hacker earth problem solution
- jadu and dna | hacker earth solution
- Bricks game | hacker earth problem
- Anti-Palindrome strings | hacker earth solution
- connected components in the graph | hacker earth data structure
- odd one out || hacker earth problem solution
- Minimum addition | Hackerearth Practice problem
- The magical mountain | Hackerearth Practice problem
- The first overtake | Hackerearth Practice problem

__Data structure:-__

- Program to find cycle in the graph
- Implementation of singly link list
- Implementation of queue by using link list
- Algorithm of quick sort
- stack by using link list
- program to find preorder post order and inorder of the binary search tree
- Minimum weight of spanning tree
- Preorder, inorder and post order traversal of the tree

__Key points:-__

- How to set limit in the floating value in python
- What is boolean data type
- How to print any character without using format specifier

__Must check this:-__