#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>

using namespace std;

int main()
{
	int k;
	int a[1000000];
	int num[1000000];
	int n;
	scanf("%d",&n);
	for(int i = 1;i<=n;i++)
	{
		scanf("%d",&num[i]);
    }
    for(int i = 1;i<=n-1;i++)
    {
    	
    	k = abs(num[i]-num[i+1]);
    	if(k>=1&&k<=n-1)
    	a[i]=k;
	}
 
    sort(a+1,a+n);
    for(int i = 1;i<=n-1;i++)
    {
    	if(a[i]!=i)
    	{
    		printf("No jolly\n");
    		return 0;
		}
	}
	printf("Jolly\n");
	return 0;
}