#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int main() {
	string s;
	cin >> s;
	if (s.sz < 2) {
		cout << "NA" << endl;
		return 0;
	}
	rep(i, 0, s.sz - 2) {
		if (s[i] == 'O' && s[i + 1] == 'O' && s[i + 2] == 'O') {
			cout << "East" << endl;
			return 0;
		}
		if (s[i] == 'X' && s[i + 1] == 'X' && s[i + 2] == 'X') {
			cout << "West" << endl;
			return 0;
		}
	}
	cout << "NA" << endl;
	return 0;
}