#include<bits/stdc++.h>
 
using namespace std;
int main()
{
    int n; int i,a[3001],d[3001],j,b;
 
    while(scanf("%d",&n)==1){
           b=1;
 
 
    for(i=0;i<n;i++)
    {
        scanf("%d",&a[i]);
    }
    for(i=0;i<n-1;i++)
    {
        d[i]=fabs(a[i+1]-a[i]);
       // printf("%d\n",d[i]);
 
    }
    sort(d,d+n-1);
 
 
    for(j =0;j<n-1;j++)
    {
       // printf("%d ",d[j]);
        if(d[j]==d[j+1]){
            b=0;
            break;
        }
 
    }
 
 
 
    if(b==0)
        printf("Not jolly\n");
    else
        printf("Jolly\n");
 
    }
 
 
    return 0;
}
 

I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CmludCBtYWluKCkKewogICAgaW50IG47IGludCBpLGFbMzAwMV0sZFszMDAxXSxqLGI7CgogICAgd2hpbGUoc2NhbmYoIiVkIiwmbik9PTEpewogICAgICAgICAgIGI9MTsKCgogICAgZm9yKGk9MDtpPG47aSsrKQogICAgewogICAgICAgIHNjYW5mKCIlZCIsJmFbaV0pOwogICAgfQogICAgZm9yKGk9MDtpPG4tMTtpKyspCiAgICB7CiAgICAgICAgZFtpXT1mYWJzKGFbaSsxXS1hW2ldKTsKICAgICAgIC8vIHByaW50ZigiJWRcbiIsZFtpXSk7CgogICAgfQogICAgc29ydChkLGQrbi0xKTsKCgogICAgZm9yKGogPTA7ajxuLTE7aisrKQogICAgewogICAgICAgLy8gcHJpbnRmKCIlZCAiLGRbal0pOwogICAgICAgIGlmKGRbal09PWRbaisxXSl7CiAgICAgICAgICAgIGI9MDsKICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgfQoKICAgIH0KCgoKICAgIGlmKGI9PTApCiAgICAgICAgcHJpbnRmKCJOb3Qgam9sbHlcbiIpOwogICAgZWxzZQogICAgICAgIHByaW50ZigiSm9sbHlcbiIpOwoKICAgIH0KCgogICAgcmV0dXJuIDA7Cn0K

MSAyMDAwCjUgMSA0IDIgLTEgNgoyIDE5OTkgMTk5OAo0IDEgNCAyIDMKNCAxIDMgMiAtMgo0IDEgNCAzIDUKNCAxIDIgNSA3CjMgNCAxIDMKNCAxIDQgMiAzCjQgMSAyIDMgNgoyIDEgMwoxIDE=

1 2000
5 1 4 2 -1 6
2 1999 1998
4 1 4 2 3
4 1 3 2 -2
4 1 4 3 5
4 1 2 5 7
3 4 1 3
4 1 4 2 3
4 1 2 3 6
2 1 3
1 1