#include<bits/stdc++.h>
using namespace std;
const int N = 1005;
int n, a[N], b[N];
int main() {
	scanf("%d", &n);
	for (int i = 1; i <= n - 1; ++i, b[i] = abs(a[i] - a[i + 1]));
	bool cmp = false;
	for (int i = 1; i <= n - 1; ++i, cmp = (b[i] != b[i + 1] + 1 || cmp == true) ? true : false);
	if (cmp == false)printf("Jolly");
	else printf("Not jolly");
	return 0;
}