#include<iostream> #include<cstdio> #include<cmath> #include<algorithm> using namespace std; long long num[3001]; long long dis[3001]; long long nums[3001]; int main() { int n; long long flag = 1; long long sum = 0; cin>>n; for(int i = 0;i<n;i++) { cin>>num[i]; } for(int i = 0;i<n;i++) { dis[i] = abs(num[i+1]-num[i]); } sort(dis,dis+n); for(int i = 0;i<n;i++) { nums[i] = flag; flag++; if(nums[i] == dis[i]) sum++; } if(sum == n-1 || n == 1) cout<<"Jolly"<<endl; else cout<<"Not jolly"<<endl; return 0; }