description: You had n positive integers a_1, a_2, ..., a_n arranged in a circle. For each pair of neighboring numbers (a_1 and a_2, a_2 and a_3, ..., a_{n - 1} and a_n, and a_n and a_1), you wrote down: are the numbers in the pair equal or not.
  
  Unfortunately, you've lost a piece of paper with the array a. Moreover, you are afraid that even information about equality of neighboring elements may be inconsistent. So, you are wondering: is there any array a which is consistent with information you have about equality or non-equality of corresponding pairs?
  
  Input
  
  The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases. Next t cases follow.
  
  The first and only line of each test case contains a non-empty string s consisting of characters E and/or N. The length of s is equal to the size of array n and 2 ≤ n ≤ 50. For each i from 1 to n: 
  
    * if s_i = E then a_i is equal to a_{i + 1} (a_n = a_1 for i = n); 
    * if s_i = N then a_i is not equal to a_{i + 1} (a_n ≠ a_1 for i = n). 
  
  Output
  
  For each test case, print YES if it's possible to choose array a that are consistent with information from s you know. Otherwise, print NO.
  
  It can be proved, that if there exists some array a, then there exists an array a of positive integers with values less or equal to 10^9.
  
  Example
  
  Input
  
  
  4
  EEE
  EN
  ENNEENE
  NENN
  
  
  Output
  
  
  YES
  NO
  YES
  YES
  
  Note
  
  In the first test case, you can choose, for example, a_1 = a_2 = a_3 = 5.
  
  In the second test case, there is no array a, since, according to s_1, a_1 is equal to a_2, but, according to s_2, a_2 is not equal to a_1.
  
  In the third test case, you can, for example, choose array a = [20, 20, 4, 50, 50, 50, 20].
  
  In the fourth test case, you can, for example, choose a = [1, 3, 3, 7].
solution: import java.io.*;
  import java.util.*;
  
  public class A {
      void go() {
          String s = Reader.next();
          int n = s.length();
  
          char x = s.charAt(0);
          char z = s.charAt(n - 1);
  
          int cnt = 0;
          for(int i = 1; i < n - 1; i++) {
              cnt += s.charAt(i) == 'N' ? 1 : 0;
          }
  
          if(x == 'E' && z == 'E') {
              if(cnt == 1) Writer.println("NO");
              else Writer.println("YES");
          } else if(x == 'E' && z == 'N') {
              if(cnt == 0) Writer.println("NO");
              else Writer.println("YES");
          } else if(x == 'N' && z == 'N') {
              Writer.println("YES");
          } else {
              if(cnt == 0) Writer.println("NO");
              else Writer.println("YES");
          }
      }
      void solve() {
          for(int T = Reader.nextInt(); T > 0; T--) go();
      }
      void run() throws Exception {
          Reader.init(System.in);
          Writer.init(System.out);
          solve();
          Writer.close();
      }
  
      public static void main(String[] args) throws Exception {
          new A().run();
      }
  
      public static class Reader {
          public static StringTokenizer st;
          public static BufferedReader br;
  
          public static void init(InputStream in) {
              br = new BufferedReader(new InputStreamReader(in));
              st = new StringTokenizer("");
          }
  
          public static String next() {
              while(!st.hasMoreTokens()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
              }
              return st.nextToken();
          }
  
          public static int nextInt() {
              return Integer.parseInt(next());
          }
  
          public static long nextLong() {
              return Long.parseLong(next());
          }
  
          public static double nextDouble() {
              return Double.parseDouble(next());
          }
      }
  
      public static class Writer {
          public static PrintWriter pw;
  
          public static void init(OutputStream os) {
              pw = new PrintWriter(new BufferedOutputStream(os));
          }
  
          public static void print(String s) {
              pw.print(s);
          }
  
          public static void print(char c) {
              pw.print(c);
          }
  
          public static void print(int x) {
              pw.print(x);
          }
  
          public static void print(long x) {
              pw.print(x);
          }
  
          public static void println(String s) {
              pw.println(s);
          }
  
          public static void println(char c) {
              pw.println(c);
          }
  
          public static void println(int x) {
              pw.println(x);
          }
  
          public static void println(long x) {
              pw.println(x);
          }
  
          public static void close() {
              pw.close();
          }
      }
  }