#include<iostream>
#include<math.h>
#include<string.h>
using namespace std;
int n,x,y;
bool a[3001];
int main(){
	while(cin>>n){
		memset(a,false,sizeof(a));
        cin>>x;
		for(int i=2;i<=n;i++){
            cin>>y;
			int cha=abs(y-x);
            if(cha<n)a[cha]=true;
            x=y;
		}
		int cnt=0;
		for(int i=1;i<=n-1;i++)if(a[i])cnt++;
		if(cnt==n-1)cout<<"Jolly\n";
		else cout<<"Not jolly\n";
	}
	return 0;
}

/*****************************************
备注：
******************************************/
#include <queue>
#include <math.h>
#include <stack>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <algorithm>
using namespace std;
#define LL long long
const int N = 1e5 + 10;
const int INF = 0x3f3f3f3f;
int a[N];
int main()
{
	int n ;
	while(cin >> n)
	{
		memset(a,0,sizeof(a));//string.h  初始化数组
		int pre;
		cin >> pre;
		int now;
		for(int i = 1 ; i < n ; i++)
		{
			cin >> now;
			int s = now - pre;
			if(s < 0)
				s = s * -1;
			a[s] = 1;
			pre = now;
		}
		int flag = 1;
		for(int i = 1 ; i < n ; i++)
		{
			if(a[i] == 0)
			{
				flag=  0;
				break;
			}
		}
		if(flag == 1)
			cout << "Jolly\n";
		else 
			cout << "Not jolly\n";
	}
	return 0;
}