문제1476--Jolly Jumpers

1476: Jolly Jumpers

실행시간 제한: 1 Sec  메모리사용 제한: 64 MB
제출: 722  통과: 179
[제출] [채점기록] [묻고답하기]

문제 설명

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.

입력 설명

Each line of input contains an integer n < 3000 followed by n integers representing the sequence.

출력 설명

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

입력 예시 Copy

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


출력 예시 Copy

Jolly
Not jolly