#include <bits/stdc++.h>
using namespace std;

typedef ostringstream OSS; typedef istringstream ISS;
typedef long long LL;
typedef pair<int, int> PII;  typedef pair<LL, LL> PLL;
typedef vector<int>    VI;   typedef vector<VI>   VVI;   typedef vector<VVI>   VVVI;
typedef vector<LL>     VLL;  typedef vector<VLL>  VVLL;  typedef vector<VVLL>  VVVLL;
typedef vector<double> VD;   typedef vector<VD>   VVD;   typedef vector<VVD>   VVVD;
typedef vector<string> VS;   typedef vector<VS>   VVS;   typedef vector<VVS>   VVVS;
typedef vector<bool>   VB;   typedef vector<VB>   VVB;   typedef vector<VVB>   VVVB;
typedef vector<PII>    VPII; typedef vector<VPII> VVPII; typedef vector<VVPII> VVVPII;
typedef vector<PLL>    VPLL; typedef vector<VPLL> VVPLL; typedef vector<VVPLL> VVVPLL;

typedef unsigned int  UI;
typedef vector<UI>    VUI;
typedef vector<VUI>   VVUI;

#define fst first
#define snd second
// #define Y first
// #define X second
#define MP make_pair
#define PB push_back
#define EB emplace_back 
#define ALL(x)  (x).begin(),(x).end()
#define RALL(x) (x).rbegin(),(x).rend()
#define RANGEBOX(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))
#define RANGE(x, l, r) ((l) <= (x) && (x) <= (r))
#define rep(i, N)  for (int i = 0; i < (int)(N); i++)
#define rrep(i, N) for (int i = N - 1; i >= 0; i--)
#define REP(i, init, N)  for (int i = (init); i < (int)(N); i++)
#define RREP(i, N, last) for (int i = (init - 1); i >= last; i--)
#define MAXUD(orig, target) orig = max(orig, target)
#define MINUD(orig, target) orig = min(orig, target)
#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

template < typename T > inline T fromString(const string &s) { T res; ISS iss(s); iss >> res; return res; };
template < typename T > inline string toString(const T &a)   { OSS oss; oss << a; return oss.str(); };

template<typename T=int> inline void dump(vector<T> vs, bool ent=false) { rep(i, vs.size()) cout << vs[i] << (i+1==vs.size() ? '\n' : ' '); if (ent) cout << endl; }
template<typename T = int> inline void dump(vector<vector<T>> vs, bool ent = false) { rep(i, vs.size()) dump<T>(vs[i]); if (ent) cout << endl; }

const int    INF  = 0x3f3f3f3f;
const LL     INFL = 0x3f3f3f3f3f3f3f3fLL;
const double DINF = 0x3f3f3f3f;
const int    DX[] = {1,  0, -1, 0};
const int    DY[] = {0, -1,  0, 1};
const double EPS  = 1e-12;
// const double PI   = acos(-1.0);
// lambda: [](T1 x)->T2{return y;}
// simple lambda: [](T x){return x;}

string alphas("abcdefghijk");
int alphas_num = alphas.size();

typedef pair<bool, int> Res;

Res formula(string &s, int pos, int p) {
    char c = s[pos];
    
    if (c == 'T') { return MP(true, pos + 1); }
    if (c == 'F') { return MP(false, pos + 1); }

    auto cpos = find(ALL(alphas), c);
    if (cpos != alphas.end()) {
        int idx = cpos - alphas.begin();
        return MP(p >> idx & 1, pos + 1);
    }

    if (c == '(') {
        Res x = formula(s, pos + 1, p);
        pos = x.snd;

        string op = "";
        op += s[pos];
        ++pos;
        if (op == "-") {
            op += s[pos];
            assert(op == "->");
            ++pos;
        }

        Res y = formula(s, pos, p);
        pos = y.snd;

        assert(s[pos] == ')');
        ++pos;

        if (op == "->") {
            return MP(!x.fst || y.fst, pos);
        } else if (op == "*") {
            return MP(x.fst && y.fst, pos);
        } else if (op == "+") {
            return MP(x.fst || y.fst, pos);
        } else {
            assert(false);
        }
    }

    if (c == '-') {
        Res x = formula(s, pos + 1, p);
        return MP(!x.fst, x.snd);
    }

    assert(false);
}

bool solve(string s1, string s2) {
    rep(p, 1 << alphas_num) {
        Res res1 = formula(s1, 0, p);
        Res res2 = formula(s2, 0, p);
        if (res1.fst != res2.fst) {
            return false;
        }
    }
    return true;
}

int main(void) {
    string s;
    while (cin >> s, s != "#"){
        auto pos = find(ALL(s), '=') - s.begin();
        string s1 = s.substr(0, pos);
        string s2 = s.substr(pos + 1, s.size());
        cout << (solve(s1, s2) ? "YES" : "NO") << endl;
    }

    return 0;
}

Measured memory_bytes: 3264