////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

//// i/o helper ////

struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { bool f; _Writer() : f(false) { } template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__
#define WRITE(...) _Writer(), __VA_ARGS__; cout << endl
inline int sign(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }

template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };
template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
template <class T1, class T2> inline ostream & operator << (ostream &out, pair<T1, T2> &p) { out << p.first << p.second; return out; }
template <class T> inline ostream & operator << (ostream &out, const vector<T> &v)
{
	ostringstream ss;
	for (auto x : v) ss << x << ' ';
	auto s = ss.str();
	out << s.substr(0, s.length() - 1);
	return out;
}


//// algorithm ////

// 文字列の置換
void inplaceReplace(string &target, const string &from, const string &to, bool global = false)
{
	do
	{
		string::size_type pos = target.find(from);
		if (pos == target.npos) { break; }
		target.replace(pos, from.length(), to);
	} while (true);
}

// 文字列の分割
vector<string> split(const string &str, const string &s, bool removeEmpty = false)
{
	vector<string> ret;
	size_t p = 0, sl = s.size();
	while (true)
	{
		size_t q = str.find(s, p);
		if (q == str.npos) break;
		ret.push_back(str.substr(p, q - p));
		p = q + sl;
	}
	ret.push_back(str.substr(p));
	if (removeEmpty) ret.erase(remove(allof(ret), string()), ret.end());
	return ret;
}

//// start up ////
void solve();
int main()
{
	solve();
	return 0;
}

////////////////////
/// template end ///
////////////////////

bool eval(string form, int table, map<string, bool > &memo)
{
	inplaceReplace(form, "a", string(1, table >> 0 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "b", string(1, table >> 1 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "c", string(1, table >> 2 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "d", string(1, table >> 3 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "e", string(1, table >> 4 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "f", string(1, table >> 5 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "g", string(1, table >> 6 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "h", string(1, table >> 7 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "i", string(1, table >> 8 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "j", string(1, table >> 9 & 1 ? 'T' : 'F'), true);
	inplaceReplace(form, "k", string(1, table >> 10 & 1 ? 'T' : 'F'), true);

	if (memo.count(form)) return memo[form];
	string org = form;
	while (form.size() > 1)
	{
		inplaceReplace(form, "-T", "F", true);
		inplaceReplace(form, "-F", "T", true);
		
		inplaceReplace(form, "(T*T)", "T", true);
		inplaceReplace(form, "(T*F)", "F", true);
		inplaceReplace(form, "(F*T)", "F", true);
		inplaceReplace(form, "(F*F)", "F", true);

		inplaceReplace(form, "(T+T)", "T", true);
		inplaceReplace(form, "(T+F)", "T", true);
		inplaceReplace(form, "(F+T)", "T", true);
		inplaceReplace(form, "(F+F)", "F", true);

		inplaceReplace(form, "(T->T)", "T", true);
		inplaceReplace(form, "(T->F)", "F", true);
		inplaceReplace(form, "(F->T)", "T", true);
		inplaceReplace(form, "(F->F)", "T", true);
	}

	return memo[org] = (form == "T");
}


void solve()
{
	int testcases = INF;
	REP(testcase, testcases)
	{
		READ(string, eq);
		if (eq == "#") { break; }

		auto forms = split(eq, "=");
		map<string, bool> memo;
		bool error = false;
		REP(i, 1 << 11)
		{
			if (eval(forms[0], i, memo) != eval(forms[1], i, memo))
			{
				error = true;
				break;
			}
		}
		WRITE( error ? "NO" : "YES");
	}
}

Measured memory_bytes: 1524