#include<stdio.h>
#include <algorithm>
using namespace std;
int main()
{
    long int a[9999],n,i,b[9999],c,k;
    while(scanf("%ld",&n)==1&&n>0)
    {
        c=0;
        for(i=0; i<n; i++)
            scanf("%ld",&a[i]);
        for(i=1; i<n; i++)
        {
            b[c]=a[i]-a[i-1];
            (b[c]<0)?b[c]*=(-1):b[c]*=1;
            c++;
        }
 
        sort(b,b+c);
        for(i=0; i<c-1; i++)
            {
                if(b[i]==b[i+1]||b[i]>n-1||b[i+1]>n-1)
                {
                    k=0;
                    break;
                }
                else
                    k=1;
            }
        (k==0)?printf("Not jolly\n"):printf("Jolly\n");
 
    }
    return 0;
}

I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKQp7CiAgICBsb25nIGludCBhWzk5OTldLG4saSxiWzk5OTldLGMsazsKICAgIHdoaWxlKHNjYW5mKCIlbGQiLCZuKT09MSYmbj4wKQogICAgewogICAgICAgIGM9MDsKICAgICAgICBmb3IoaT0wOyBpPG47IGkrKykKICAgICAgICAgICAgc2NhbmYoIiVsZCIsJmFbaV0pOwogICAgICAgIGZvcihpPTE7IGk8bjsgaSsrKQogICAgICAgIHsKICAgICAgICAgICAgYltjXT1hW2ldLWFbaS0xXTsKICAgICAgICAgICAgKGJbY108MCk/YltjXSo9KC0xKTpiW2NdKj0xOwogICAgICAgICAgICBjKys7CiAgICAgICAgfQoKICAgICAgICBzb3J0KGIsYitjKTsKICAgICAgICBmb3IoaT0wOyBpPGMtMTsgaSsrKQogICAgICAgICAgICB7CiAgICAgICAgICAgICAgICBpZihiW2ldPT1iW2krMV18fGJbaV0+bi0xfHxiW2krMV0+bi0xKQogICAgICAgICAgICAgICAgewogICAgICAgICAgICAgICAgICAgIGs9MDsKICAgICAgICAgICAgICAgICAgICBicmVhazsKICAgICAgICAgICAgICAgIH0KICAgICAgICAgICAgICAgIGVsc2UKICAgICAgICAgICAgICAgICAgICBrPTE7CiAgICAgICAgICAgIH0KICAgICAgICAoaz09MCk/cHJpbnRmKCJOb3Qgam9sbHlcbiIpOnByaW50ZigiSm9sbHlcbiIpOwoKICAgIH0KICAgIHJldHVybiAwOwp9

NCAxIDMgMiAtMgozIDQgMSAzCjQgMSA0IDIgMw==

4 1 3 2 -2
3 4 1 3
4 1 4 2 3