#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>
#include <bitset>
#include <cassert>

using namespace std;

int main() {

    string S;
    cin >> S;
    int N = S.size();
    if (N < 3) {
        cout << "NA" << endl;
    } else {

        assert(N >= 1);

        pair<char, int> p;
        p.first = S[0];
        p.second = 1;

        string res = "NA";

        for (int i = 1; i < N; ++i) {
            if (p.first == S[i]) {
                p.second += 1;
            } else {
                p.first = S[i];
                p.second = 1;
            }

            if (p.second == 3) {
                res = p.first == 'O' ? "East" : "West";
                break;
            }
        }

        cout << res << endl;
    }

    return 0;
}