POJ3295

/***********************************
Problem: 3295		User: 626478972
Memory: 212K		Time: 16MS
Language: C++		Result: Accepted

************************************/

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cmath>
#include <stack>
#include <iostream>
const double PI=acos(-1.0);
using namespace std;
typedef long long ll;
int b[1005];
int main()
{
    stack<char> st;
    char str[1005];
    while(~scanf("%s",str)) {
        if(strcmp(str,"0")==0) {
            break;
        }
        int len=strlen(str),flag=0;
        for(b['p']=0;b['p']<=1;b['p']++) {
            for(b['q']=0;b['q']<=1;b['q']++) {
                for(b['r']=0;b['r']<=1;b['r']++) {
                    for(b['s']=0;b['s']<=1;b['s']++) {
                        for(b['t']=0;b['t']<=1;b['t']++) {
                            for(int i=len-1;i>=0;i--) {
                                if(str[i]>='p'&&str[i]<='t') {
                                    st.push(b[str[i]]);
                                }
                                else if(str[i]=='N') {
                                    int temp=st.top();
                                    st.pop();
                                    temp=!temp;
                                    st.push(temp);
                                }
                                else {
                                    int temp1=st.top();
                                    st.pop();
                                    int temp2=st.top();
                                    st.pop();
                                    if(str[i]=='K') {
                                        st.push(temp1&temp2);
                                    }
                                    else if(str[i]=='A') {
                                        st.push(temp1|temp2);
                                    }
                                    else if(str[i]=='C') {
                                        st.push(!temp1|temp2);
                                    }
                                    else if(str[i]=='E') {
                                        st.push(temp1==temp2);
                                    }
                                }
                            }
                            int temp=st.top();
                            st.pop();
                            if(temp==0) {
                                flag=1;
                            }
                        }
                    }
                }
            }
        }
        if(flag==0) {
            printf("tautology\n");
        }
        else printf("not\n");
    }
    return 0;
}
/*
ApNp
ApNq
0
*/