12 1 s 64 MB
WFF 'N PROOF is a logic game played with dice. Each dice has six faces representing some subset of the possible symbols K, A, N, C, E, p, q, r, s, t. A Wellformed formula (WFF) is any string of these symbols obeying the following rules:

w x  Kwx  Awx  Nw  Cwx  Ewx 
1 1  1  1  0  1  1 
1 0  0  1  0  0  0 
0 1  0  1  1  1  0 
0 0  0  0  1  1  1 
A tautology is a WFF that has value 1 (true) regardless of the values of its variables. For example, ApNp is a tautology because it is true regardless of the value of p. On the other hand, ApNq is not, because it has the value 0 for p=0, q=1.
You must determine whether or not a WFF is a tautology.
Input consists of several test cases. Each test case is a single line containing a WFF with no more than 100 symbols. A line containing 0 follows the last case.
For each test case, output a line containing tautology or not as appropriate.
Sample Input  Sample Output 

ApNp ApNq 0  tautology not 