#include <algorithm>
using namespace std;
int main() {
	int arr[1001];//原始数组
	long long n;
	int a = 0;
	
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		cin >> arr[i];
	}
	
	int arr3[1000];//相减后的数组
	for (int i = 0; i < n; i++)
	{
		arr3[i] = arr[i] - arr[i + 1];
		abs(arr3[i]);

	}
	sort(arr3, arr3 + n, greater<int>());
	int c = unique(arr3, arr3 + n) - arr3;   // 去重
	int arr2[1001];
	for (int i = 0; i < n; i++)
	{
		a++;
		a >> arr2[i];//一个123456...的数组
	}
   int arrsize = sizeof(arr3) / sizeof(arr3[0]);
	if (std::equal(arr2, arr2 + arrsize, arr3))
	{
		cout << "jolly";
	}
	else { cout << "Not jolly"; }


	return 0;