Jolly Jumpers – Kattis, Kattis (original) (raw)

Hide

A sequence of n>0n > 0n>0 integers is called a jolly jumper if the absolute values of the difference between successive elements take on all the values 111 through$n-1$. For instance,

1 4 2 3

is a jolly jumper, because the absolutes differences are$3$, 222, and 111 respectively. The definition implies that any sequence of a single integer is a jolly jumper. You are to write a program to determine whether or not each of a number of sequences is a jolly jumper.

Input

Each line of input contains an integer nle3000n \le 3000nle3000 followed by nnn integers representing the sequence. The values in the sequence are at most 300,000300\, 000300,000 in absolute value. Input contains at most 101010 lines.

Output

For each line of input, generate a line of output saying “Jolly” or “Not jolly”.

Please log in to submit a solution to this problem

Log in

You haven't made any submissions on this problem yet.