#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

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