#include #include #include #include #include #include using namespace std; #define REP(i, j) for (int i = 0; i < (int)j; ++i) #define FOR(i, j, k) for (int i = (int)j; i < (int)k; ++i) #define SORT(v) sort(v.begin(), v.end()) #define REVERSE(v) reverse(v.begin(), v.end()) typedef complex P; typedef vector VI; typedef long long LL; typedef pair PII; int main() { cin.tie(0); ios::sync_with_stdio(false); string E = "East", W = "West", N = "NA"; string s; cin >> s; int ei = s.find("OOO"), wi = s.find("XXX"); if (ei == string::npos && wi == string::npos) cout << N << endl; if (ei != string::npos && ei < wi) cout << E << endl; if (wi != string::npos && wi < ei) cout << W << endl; return 0; }