#include <bits/stdc++.h>
using namespace std;
#define int long long
// #define stoi stoll
using ll=long long;
using vi=vector<int>;
using pii=pair<int,int>;
#define ALL(c) begin(c),end(c)
#define RALL(c) rbegin(c),rend(c)
#define ITR(i,b,e) for(auto i=(b);i!=(e);++i)
#define FORE(x,c) for(auto &x:c)
#define REPF(i,a,n) for(int i=a,i##len=(int)(n);i<i##len;++i)
#define REP(i,n) REPF(i,0,n)
#define REPR(i,n) for(int i=(int)(n);i>=0;--i)
#define SZ(c) ((int)c.size())
#define CONTAIN(c,x) (c.find(x)!=end(c))
#define OUTOFRANGE(y,x,h,w) (y<0||x<0||y>=h||x>=w)
#define dump(...)
const signed INF_=1001001001; const ll INF=1001001001001001001LL;
const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os,const vector<T> &v) {
    ITR(i,begin(v),end(v))os<<*i<<(i==end(v)-1?"":"\n");return os;}
template<class T> istream& operator>>(istream &is,vector<T> &v) {
    ITR(i,begin(v),end(v)) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
    is>>p.first>>p.second;return is;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;}
template<class T> using heap=priority_queue<T,vector<T>,greater<T>>;
struct{template<class T> operator T(){T x;cin>>x;return x;}} IN;
struct before_main_function {
    before_main_function() {
        cin.tie(0);ios::sync_with_stdio(false);
        cout<<setprecision(15)<<fixed;
        #define endl "\n"
    }
} before_main_function;
//------------------8<------------------------------------8<--------------------

/*
<equation> ::= <formula> '=' <formula>
<formula> ::= <constant> | <variable> | <term> | <negative>
<term> ::= '(' (<formula> '*' <formula> | <formula> '+' <formula> | <formula> "->" <formula>) ')'
<negative> ::= '-' <formula>
 */
bool equation(string &s,int &i,int var);
bool formula(string &s,int &i,int var);
bool constant(string &s,int &i,int var);
bool variable(string &s,int &i,int var);
bool term(string &s,int &i,int var);
bool negative(string &s,int &i,int var);

bool equation(string &s,int &i,int var) {
    bool left=formula(s,i,var);
    assert(s[i]=='=');
    i++;
    bool right=formula(s,i,var);
    return left==right;
}
bool formula(string &s,int &i,int var) {
    if(s[i]=='T' || s[i]=='F') {
        bool c=constant(s,i,var);
        return c;
    } else if('a'<=s[i] && s[i]<='k') {
        bool v=variable(s,i,var);
        return v;
    } else if(s[i]=='-') {
        bool neg=negative(s,i,var);
        return neg;
    } else if(s[i]=='(') {
        bool t=term(s,i,var);
        return t;
    }
}
bool constant(string &s,int &i,int var) {
    if(s[i]=='T') {
        i++;
        return true;
    } else {
        i++;
        return false;
    }
}
bool variable(string &s,int &i,int var) {
    int idx=s[i]-'a';
    i++;
    return ((var>>idx)&1);
}
bool term(string &s,int &i,int var) {
    i++; // (
    bool x=formula(s,i,var);
    int op;
    if(s[i]=='*') op=0,i++;
    else if(s[i]=='+') op=1,i++;
    else if(s[i]=='-') op=2,i+=2;  // ->
    bool y=formula(s,i,var);
    i++; // )
    if(op==0) return x&&y;
    if(op==1) return x||y;
    if(op==2) return (!x||y);
}
bool negative(string &s,int &i,int var) {
    i++; // -
    int f=formula(s,i,var);
    return !f;
}
void solve(string s) {
    int res=-1;
    for(int bit=0;bit<(1<<11);bit++) {
        int i=0;
        if(!equation(s,i,bit)) {
            cout<<"NO"<<endl;
            return;
        }
    }
    cout<<"YES"<<endl;
    return;
}
signed main() {
    string s;
    while(cin>>s) {
        if(s=="#") break;
        solve(s);
    }
    return 0;
}



Measured memory_bytes: 3252