求调必关

#include<bits/stdc++.h>
using namespace std;
int b, a[1006], i, c[1006];
void qsort(int l, int r) {
	int i, j, mid, p;
	i = l;
	j = r;
	mid = a[(l + r) / 2];
	do {
		while (a[i] < mid) i++;
		while (a[j] > mid) j--;
		{
			p = a[i];
			a[i] = a[j];
			a[j] = p;
			i++;
			j--;
		}
	} while (i <= j);
	if (l < j) qsort(l, j);
	if (i < r) qsort(i, r);
}
int main() {
	cin >> b;
	for (i = 0; i < b; i++) {
		cin >> a[i];
		c[i] = i + 1;
	}
	qsort(1, b - 1);
	for (i = 0; i < b; i++) {
		if (a[i] != c[i]) {
			cout << "Not jolly\n";
			return 0;
		}
	}
	cout << "Jolly\n";
	return 0;
}