Jolly Jumper

Problem Description

A sequence of length $n\;(n>0)$ has a "jolly jump" if and only if the absolute differences of adjacent elements, when sorted, are exactly the integers from $1$ to $(n-1)$. For example, 1 4 2 3 has a jolly jump, because the absolute differences are $3,2,1$. Of course, any sequence containing only a single element always has a jolly jump. Write a program to determine whether a given sequence has a jolly jump.

Input Format

One line: the first number is $n\;(0 < n < 3000)$, the length of the sequence, followed by $n$ integers, the elements of the sequence in order. The absolute value of each element does not exceed $1\,000\,000\,000$.

Output Format

One line. If the sequence has a jolly jump, output Jolly; otherwise output Not jolly.

Sample Input

4 1 4 2 3

Sample Output

Jolly