#include <iostream>
#include <iomanip>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <algorithm>
#include <complex>
#include <stdint.h>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

//#define NU_DEBUG

using namespace std;

#define REP(i,n) for(int i = 0; i < (int)(n); i++)
#define FOR(i,c) for(__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALLOF(c) (c).begin(), (c).end()

typedef double decimal;
const decimal EPS = 1e-8;

int main(){
  char trump;
  while(cin >> trump){
    if(trump == '#') break;
    int ranks[4][13];
    char suits[4][13];
    REP(i, 4){
      REP(j, 13){
        char crank, suit;
        cin >> crank >> suit;
        string str = "23456789TJQKA";
        int rank = str.find(crank);
        ranks[i][j] = rank;
        suits[i][j] = suit;
      }
    }
    int winner = 0;
    int wins[2] = {0, 0};
    REP(i, 13){
      int suit = suits[winner][i];
      int rank = ranks[winner][i];
      REP(seat, 4){
        int mysuit = suits[seat][i];
        int myrank = ranks[seat][i];
        if(mysuit == suit){
          if(myrank > rank){
            rank = myrank;
            winner = seat;
          }
        }else if(mysuit == trump){
          suit = trump;
          rank = myrank;
          winner = seat;
        }
      }
#ifdef NU_DEBUG
      cerr << "winner = " << "NESW"[winner] << endl;
#endif
      wins[winner&1]++;
    }
    if(wins[0] > wins[1]){
      cout << "NS " << wins[0] - 6 << endl;
    }else{
      cout << "EW " << wins[1] - 6 << endl;
    }
  }

  return 0;
}