#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
int main() {
   int n;
   cin>>n;
   int an[n];
   int diff[n-1];                                       //两数差值数组
   int mark = 1;
   for(int i=0;i<n;i++) {                               //输入
       cin >> an[i];
   }

   for(int i=0;i<n-1;i++){
       diff[i] = abs(an[i+1]-an[i]);
   }
    sort(diff,&diff[n-1]);                   
   sort(an,&an[n]);
   for(int i = 0;i<n-1;i++){                        //排序后两数组相等
       if(an[i]!=diff[i]){
           mark = -1;
           break;
       }
   }
   if(mark !=-1){
       cout<<"Jolly";
   }
   else{
       cout<<"Not jolly";
   }



    return 0;
}