#include<cstdio>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
const int N = 1e5+10;
int p[N];
int b[N];

int main()
{
	int n,t,flag = 0;
	scanf("%d",&n);
	for(int i = 1;i<=n;i++){
		scanf("%d",&p[i]);
		b[i]=0;
	}
	for( int i = 1;i<=(n-1);i++){
		t = p[i+1]-p[i];
		if(t>0){
			b[t] = 1;
		}else if(t<0){
			t = -t;
			b[t] = 1;
		}else{
			continue;
		}
	}
	for(int i = 1;i<n;i++){
		if(b[i]==1&&i==(n-1)){
			flag = 1;
		}else if(b[i]==1&&i<(n-1)){
			continue;
		}else{
			break;
		}
	}
	if(flag==1){
		printf("Jolly\n");
	}else{
		printf("Not Jolly\n");
	}
	return 0;
}