p2) 10038 - Jolly Jumpers

#include<iostream>
#include<cstdio>
#define N 3005

using namespace std;

bool vis[N];
int a[N];

int main(){

    int n, dif;
    while(scanf("%d", &n) == 1){

        for(int i = 1; i <= n - 1; i++)vis[i] = false;
        for(int i = 0; i < n; i++)scanf("%d", &a[i]);

        for(int i = 1; i < n; i++){

            dif = abs(a[i] - a[i - 1]);
            if(dif >= 1 && dif <= n - 1)vis[dif] = true;
        }

        bool ok = true;
        for(int i = 1; i <= n - 1; i++)
            if(vis[i] == false)ok = false;

        if(ok)printf("Jolly\n");
        else printf("Not jolly\n");
    }

}