#include<iostream>
#include<string>
#include<cstring>
#include<complex>
#include<vector>
#include<algorithm>
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<double> P;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int,int> 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") == string::npos ? 101 : s.find("OOO");
	int wi = s.find("XXX") == string::npos ? 101 : s.find("XXX");
	if (ei == wi) cout << N << endl;
	else if ( ei < wi) cout << E << endl;
	else cout << W << endl;

	return 0;
}