poj 2575

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<string>
#include<cstring>
using namespace std;
int flag[3001], num[3001];
int Fac(int n) {
memset(flag,0,sizeof(flag));
memset(num,0,sizeof(num));
int i,j,k,f,res=0;
for(i=1;i<=n;i++)
cin>>num[i];
for(k=2;k<=n;k++){
f=abs(num[k]-num[k-1]);
if(f<3001)
flag[f]=f;
}
for(j=1;j<n;j++)
if(!flag[j]){
res=1;break;
}
if(res)
cout<<"Not jolly"<<endl;
else
cout<<"Jolly"<<endl;
return 0;
}
int main() {
int n;
while(cin>>n)
Fac(n);
return 0;
}