ACM Q10038

import java.util.Scanner;
import java.lang.Math;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Iterator;

public class Q10038 {

public static void main(String args[]){
Scanner cin = new Scanner(System.in);
String inputLine;
while (cin.hasNextLine()){
int count =0;
int max =0;
ArrayList as = new ArrayList();

boolean flag = true;
inputLine = cin.nextLine();
String[] tokens = inputLine.split(" ");
count = Integer.parseInt(tokens[0]);
for (int i=1 ;i < tokens.length; i++) {
if(Integer.parseInt(tokens[i])> max){
max = Integer.parseInt(tokens[i]);
}

}
for (int i=1 ;i < tokens.length-1; i++) {
as.add(Math.abs(Integer.parseInt(tokens[i])-Integer.parseInt(tokens[i+1])));
}
Collections.sort(as);

for (int i=0 ;i < as.size(); i++) {
if(as.get(i)!=i+1){
System.out.println("Not jolly");
flag =false;
break;
}
}
if(flag ==true){
System.out.println("Jolly");
}


}

}
}