0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-05 16:38:48 +00:00
OI-codes/Luogu/problem/P1152/P1152.cpp
2021-01-02 15:30:52 +08:00

26 lines
441 B
C++

// R38820772
#include<bits/stdc++.h>
using namespace std;
bool cnt[10000005];
int n, a[1005];
int main() {
cin >> n;
for(int i = 0 ; i < n ; i++) {
cin >>a[i];
}
for(int i = 1 ; i < n ; i++) {
if(!cnt[abs(a[i]-a[i-1])]) {
cnt[abs(a[i]-a[i-1])] = true;
} else {
cout << "Not jolly" << endl;
return 0;
}
}
cout << "Jolly" << endl;
return 0;
}