{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\r\n\tA sequence of \u003ci\u003en \u0026gt; 0\u003c/i\u003e integers is called a \u003ci\u003ejolly jumper\u003c/i\u003e if the absolute values of the difference between successive elements take on all the values 1 through \u003ci\u003en-1\u003c/i\u003e. For instance,\u003c/p\u003e\r\n\u003cpre\u003e\r\n1 4 2 3\r\n\u003c/pre\u003e\r\n\u003cp\u003e\r\n\tis 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.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003e\r\n\tEach line of input contains an integer\u0026nbsp;\u003ci\u003en\u003c/i\u003e\u0026nbsp;\u0026lt;\u003d 3000 followed by\u0026nbsp;\u003ci\u003en\u003c/i\u003e\u0026nbsp;integers representing the sequence.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003e\r\n\tFor each line of input, generate a line of output saying \u0026quot;Jolly\u0026quot; or \u0026quot;Not jolly\u0026quot;.\u003c/p\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e\r\n4 1 4 2 3\r\n5 1 4 2 -1 6\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e\r\nJolly\r\nNot jolly\u003c/pre\u003e"}}]}