#include<iostream>
#include<cmath>
#include<algorithm>
#define N 10010
long long int a[N],b[N];
using namespace std;
bool cmp(int a, int b) {
	return a < b;
}
int main() {
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i < n; i++) {
          b[i] = abs(a[i]- a[i - 1]);
	}
	sort(b, b + n,cmp);
	for (int i = 1; i <= n - 1; i++) {
		if (b[i] != i) {
			cout << "Not jolly";
			return 0;
		}
	}
	cout << "Jolly";
	return 0;
}