1047 -- Jolly Jumpers
Time Limit :1000 MS Memory Limit :32768 KB
Accepts : 203 Submits : 877
User Accepts : 168 User Submits : 198
<Submit>   <Statistics>   <Discuss>

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

1 4 2 3

is a jolly jumper, because the absolutes differences are 3, 2, and 1 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 n < 3000 followed by n integers representing the sequence.

Output
For each line of input, generate a line of output saying "Jolly" or "Not jolly".

 

Sample Input
 

4 1 4 2 3
5 1 4 2 -1 6

Sample Output
 

Jolly
Not jolly

Source

Waterloo local 2000.09.30
<Submit>   <Statistics>   <Discuss>
 


Powered by Zhang Zhaoning PDL College of Computer
Since 2006.03.09 | 2007.11.22 | 2010.03.02 Copyright (r) 2006 - 2010 All Rights Reserved