#include<stdio.h>
#include <algorithm>
using namespace std;
int main()
{
    long int a[9999],n,i,b[9999],c;
    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])
                {
                    n=0;
                    break;
                }
                else
                    n=1;
            }
        (n==0)?printf("Not jolly\n"):printf("Jolly\n");
 
    }
    return 0;
}

I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGUgPGFsZ29yaXRobT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKaW50IG1haW4oKQp7CiAgICBsb25nIGludCBhWzk5OTldLG4saSxiWzk5OTldLGM7CiAgICB3aGlsZShzY2FuZigiJWxkIiwmbik9PTEmJm4+MCkKICAgIHsKICAgICAgICBjPTA7CiAgICAgICAgZm9yKGk9MDsgaTxuOyBpKyspCiAgICAgICAgICAgIHNjYW5mKCIlbGQiLCZhW2ldKTsKICAgICAgICBmb3IoaT0xOyBpPG47IGkrKykKICAgICAgICB7CiAgICAgICAgICAgIGJbY109YVtpXS1hW2ktMV07CiAgICAgICAgICAgIChiW2NdPDApP2JbY10qPSgtMSk6YltjXSo9MTsKICAgICAgICAgICAgYysrOwogICAgICAgIH0KCiAgICAgICAgc29ydChiLGIrYyk7CiAgICAgICAgZm9yKGk9MDsgaTxjLTE7IGkrKykKICAgICAgICAgICAgewogICAgICAgICAgICAgICAgaWYoYltpXT09YltpKzFdKQogICAgICAgICAgICAgICAgewogICAgICAgICAgICAgICAgICAgIG49MDsKICAgICAgICAgICAgICAgICAgICBicmVhazsKICAgICAgICAgICAgICAgIH0KICAgICAgICAgICAgICAgIGVsc2UKICAgICAgICAgICAgICAgICAgICBuPTE7CiAgICAgICAgICAgIH0KICAgICAgICAobj09MCk/cHJpbnRmKCJOb3Qgam9sbHlcbiIpOnByaW50ZigiSm9sbHlcbiIpOwoKICAgIH0KICAgIHJldHVybiAwOwp9

NSAxIDQgMiAtMSA2CjQgMSA0IDIgMwoxIDEKNCAxIDIgNSA3

5 1 4 2 -1 6
4 1 4 2 3
1 1
4 1 2 5 7