#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for (int i=0;i<(n);i++)
#define rep2(i,a,b) for (int i=(a);i<(b);i++)
#define rrep(i,n) for (int i=(n)-1;i>=0;i--)
#define rrep2(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef pair<int, int> P;

string S;
int L;

void solve() {
  cin >> S;
  L = S.size();
  rep(i, L - 2) {
    if (S[i] == 'O' && S[i+1] == 'O' && S[i+2] == 'O') {
      cout << "East" << endl;
      return;
    }
    else if(S[i] == 'X' && S[i+1] == 'X' && S[i+2] == 'X') {
      cout << "West" << endl;
      return;
    }
  }
  cout << "NA" << endl;
}

int main() {
  solve();
  return 0;
}