//2575  Jolly Jumpers
#include <iostream>
#include <cmath>
using namespace std;
int main()
{
    int n,num[3001],dif[3000];
    int keep;
    while(cin>>n)
    {

        bool isJolly=true;
        for(int i=1;i<=n;i++)
        {
            cin>>num[i];
            //if(num[i]>=n || num[i]<=0)  isJolly=false;
        }
        for(int i=1;i<=n-1;i++)
        {
            dif[i]=abs(num[i]-num[i+1]);
            //cout<<dif[i]<<endl;
        }
        keep=dif[2]-dif[1];
        for(int i=2;i<=n-2;i++)
        {
            if(keep==1)
            {
                if((dif[i+1]-dif[i])!=1 || dif[n-1]!=n-1)
                {
                    isJolly=false;
                    break;
                }
            }
            else if(keep==-1)
            {
                if((dif[i+1]-dif[i])!=-1 || dif[1]!=n-1)
                {
                    isJolly=false;
                    break;
                }
            }
            else
            {
                isJolly=false;
                break;
            }
        }
        if(isJolly) cout<<"Jolly"<<endl;
        else    cout<<"Not jolly"<<endl;
    }
    system("pause");
    return 0;
}