#include "bits/stdc++.h"
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i,n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long mod = 1e9 + 7;

ll gcd(ll a, ll b) {
	return b ? gcd(b, a % b) : a;
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

int main() {
	string s;
	cin >> s;

	if (s.size() < 3) {
		cout << "NA" << endl;
		return 0;
	}

	rep(i, s.size()-2) {
		if (s[i] == 'O' && s[i+1]=='O' && s[i+2]=='O') {
			cout << "East" << endl;
			return 0;
		}else if (s[i] == 'X' && s[i + 1] == 'X' && s[i + 2] == 'X') {
			cout << "West" << endl;
			return 0;
		}
	}
	cout << "NA" << endl;
}