#include <stdio.h>
#include <memory.h>
#include <algorithm>
using namespace std;
int b[3001],used[3001];
int main(void)
{
	int n,i;
	bool flag;
	while(scanf("%d",&n)!=EOF)
	{
		if(n<=0)	{flag=false;}
		else	if(n==1)	{scanf("%d",&b[0]);flag=true;}
		else{
			memset(used,0,sizeof(used));
			scanf("%d",&b[0]);
			for(i=1;i<n;i++){
				scanf("%d",&b[i]);
				int tmp=b[i]-b[i-1];
				if(abs(tmp)<=n-1 && abs(tmp)>=1 && used[abs(tmp)]==0){
					used[abs(tmp)]=1;
				}
				else break;
			}
			if(i==n)	flag=true;
			else	flag=false;
		}
		if(flag)
			printf("Jolly\n");
		else
			printf("Not jolly\n");
	}
	return 0;
}