Oh no! You were just chillin' in the fields minding your own business, when a huge catastrophe occurred. Being a dinosaur, you would expect a giant meteor or some other world--ending calamity. But it was worse! Ohh, so much worse! There was no internet connection.

A sudden urge fills you and you feel the need to run and jump over every cactus you see. You are quite good at jumping cacti, but can't jump two cacti in a row (that is, two cacti that are at a distance of 1 from one another). If you try to jump over two such consecutive cacti, you will crash into the second one and be forever without memes.

Input

This first line of the input contains the number of tests cases T.

 T test cases follow.

Each test case contains two lines. The first of these line contains a single positive integer K: the number of cacti in your way. The second line will contain K space--separated integers C_i, representing the positions of each cactus. You can asume all cacti will be in a straight line and no two cacti will be in the same position.

Output

For each case, print a single line containing the case number (see sample output for format) and "Survival!" if you can jump over all cacti or "Oh no!" otherwise.

Example

Input:
2
5
1 4 7 10 15
5
1 5 6 20 34

Output:
Case #1: Survival!
Case #2: Oh no!

Constraints

• 1 ≤ T ≤ 10³

• 1 ≤ K ≤ 10³

• 0 ≤ C_i ≤ 10³

• The cacti positions will be given in ascending order