PARADOX  Paradox
A paradox is a statement or group of statements that leads to a contradiction. Consider the following two statements.
"The statement below is false."
"The statement above is true."
If we assume that 1st statement is true then according to 1st statement the 2nd statement is false. Since the 2nd statement is false and it says that 1st statement is true, 1st statement must be false which is a contradiction. If we assume that 1st statement is false then the 2nd statement must be true (since 1st statement says 2nd statement is false). Then according to 2nd statement 1st statement must be true which is a contradiction. Thus the statement cannot be classified as true or false. This is a paradox.
Given N statements of the form "Statement X is true/false", 1<=X<=N, your task is to find if these set of statements are paradoxical or not. A set of statements is paradoxical if one or more statements cannot be classified as true or false.
Input
Multiple test cases. Each test cases begins with an integer N representing the number of statements. 1<=N<=100. Then follow N lines, representing N statements in the order 1,2,3, ...,N. Each line contains an integer X and a string S separated by a space. 1<=X<=N. S is either "true" or "false" (quotes for clarity), which means the statement is "Statement X is S". N=0 indicates the end of testcases and should not be processed. There are atmost 10000 testcases.
Output
For each test case print "PARADOX" if the set of statements are paradoxical, else print "NOT PARADOX", in a separate line.
Example
Input:
2
2 false
1 true
2
2 false
1 false
0
Output:
PARADOX
NOT PARADOX
hide comments
anirudnits:
20180602 14:07:40
simple coloring problem! 

nadstratosfer:
20180601 10:16:32
While struggling to debug, made the mistake of looking for solutions on the web. Can't remember the last time I felt so much hate from just looking at stupid code! Eventually added 3 lines to my own program and got AC; 15 lines in Python not counting the I/O.


dunjen_master:
20171219 11:19:15
loved solving it 

vicky_1998:
20171203 06:16:35
It was really interesting!!! Enjoyed solving 

sfialok98:
20170703 11:30:38
AC after a day...!! 

sonudoo:
20170619 19:37:10
After this solve CHAIN. Brute force won't work there.. 

siddharth9820:
20161228 19:52:55
I solved the question using dfs. However there's an adhoc tag. Does that mean that there is a rudimentary solution to the problem too? 

minhthai:
20160317 13:17:58
so cute that my brain explodes =D 

darkhire21:
20160118 13:05:34
3


darkhire21:
20160118 12:58:09
Last edit: 20160118 13:00:14 
Added by:  arun 
Date:  20100103 
Time limit:  3s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC PERL6 SQLITE VB.NET 
Resource:  Kurukshetra OPC 2010 