#include<algorithm>
#include<cmath>
using namespace std;
typedef long long ll;
ll a[1010];
ll b[1000010];
int main() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	for (int i = 1; i <n; i++) {
		b[abs(a[i + 1]*1ll - 1ll* a[i])]++;
	}
	
	if (b[1] != n - 1) {
		cout << "Not jolly";
		return 0;
	}
	else {
		cout<<"Jolly";
	}
	return 0;
}```