A Easy Problem about Stack;
CODE:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
#include<map>
#include<sstream>
#include<iostream>
using namespace std;
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define DOR(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define bug puts("Fuck");
#define LL long long
#define pb push_back
#define mp make_pair
#define nMax 101000
#define eps 1e-8
#define inf 0x7fffffff
int st[nMax],top;
int n;
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
#endif
while(~scanf("%d",&n)){
int now = 1,a;
top=0;
FOR(i,1,n) {
scanf("%d",&a);
while(st[top]!=a && now<=n) {
st[++top]=now;
now++;
}
if(st[top]==a && top) top--;
//else break;
}
if(top==0) printf("Not a proof\n");
else printf("Cheater\n");
}
return 0;
}