#include <stdio.h>
#include <algorithm>
using namespace std;
int main (void){
int n;
while (scanf ("%d", &n)!=EOF){
int vet1[n], vetdif1[n-1];
int isJolly=1;
for (int i=0; i<n; i++){
scanf ("%d",&vet1[i]);
if (i!=0){
vetdif1[i-1]=vet1[i]-vet1[i-1];
if (vetdif1[i-1]<0){
vetdif1[i-1]=vetdif1[i-1]*-1;
}
}
}
std::sort(vetdif1,vetdif1+n-1);
for (int i=0; i<n-1; i++){
if (vetdif1[i]!=i+1){
isJolly=0;
}
}
if (isJolly)
printf ("Jolly\n");
else printf ("Not jolly\n");
}
return 0;
}
I2luY2x1ZGUgPHN0ZGlvLmg+CiNpbmNsdWRlIDxhbGdvcml0aG0+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4gKHZvaWQpewogICAgaW50IG47CiAgICB3aGlsZSAoc2NhbmYgKCIlZCIsICZuKSE9RU9GKXsKICAgIGludCB2ZXQxW25dLCB2ZXRkaWYxW24tMV07CiAgICBpbnQgaXNKb2xseT0xOwoKICAgIGZvciAoaW50IGk9MDsgaTxuOyBpKyspewogICAgICAgIHNjYW5mICgiJWQiLCZ2ZXQxW2ldKTsKICAgICAgICBpZiAoaSE9MCl7CiAgICAgICAgICAgIHZldGRpZjFbaS0xXT12ZXQxW2ldLXZldDFbaS0xXTsKICAgICAgICAgICAgaWYgKHZldGRpZjFbaS0xXTwwKXsKICAgICAgICAgICAgICAgIHZldGRpZjFbaS0xXT12ZXRkaWYxW2ktMV0qLTE7CiAgICAgICAgICAgIH0KICAgICAgICAgICAgfQogICAgICAgIH0KICAgICAgICAgc3RkOjpzb3J0KHZldGRpZjEsdmV0ZGlmMStuLTEpOwoKICAgICAgICAgZm9yIChpbnQgaT0wOyBpPG4tMTsgaSsrKXsKICAgICAgICAgICAgICAgIGlmICh2ZXRkaWYxW2ldIT1pKzEpewogICAgICAgICAgICAgICAgICAgaXNKb2xseT0wOwogICAgICAgICAgICAgICAgfQogICAgICAgICAgfQogICAgICAgIGlmIChpc0pvbGx5KQogICAgICAgIHByaW50ZiAoIkpvbGx5XG4iKTsKICAgICAgICBlbHNlIHByaW50ZiAoIk5vdCBqb2xseVxuIik7CiAgICB9CiAgICByZXR1cm4gMDsKfQo=