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.Arrays;
  import java.util.Random;
  import java.util.StringTokenizer;
  
  public class codeforces_Edu119_A {
      private static void solve(FastIOAdapter in, PrintWriter out) {
          char[] s = in.next().toCharArray();
          int cur;
          if (s[0] == 'N') cur = -1;
          else cur = 1;
          for (int i = 1; i < s.length - 1; i++) {
              if (s[i] == 'N') {
                  if (cur == -1) {
                      cur = 0;
                      break;
                  } else {
                      cur = -1;
                  }
              }
          }
          if (cur == -1 && s[s.length - 1] == 'E' || cur == 1 && s[s.length - 1] == 'N')
              out.println("NO");
          else out.println("YES");
      }
  
      public static void main(String[] args) throws Exception {
          try (FastIOAdapter ioAdapter = new FastIOAdapter()) {
              int count = 1;
              count = ioAdapter.nextInt();
              while (count-- > 0) {
                  solve(ioAdapter, ioAdapter.out);
              }
          }
      }
  
      static void ruffleSort(int[] arr) {
          int n = arr.length;
          Random rnd = new Random();
          for (int i = 0; i < n; ++i) {
              int tmp = arr[i];
              int randomPos = i + rnd.nextInt(n - i);
              arr[i] = arr[randomPos];
              arr[randomPos] = tmp;
          }
          Arrays.sort(arr);
      }
  
      static class FastIOAdapter implements AutoCloseable {
          BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
          public PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter((System.out))));
          StringTokenizer st = new StringTokenizer("");
  
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st = new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
          String nextLine() {
              try {
                  return br.readLine();
              } catch (IOException e) {
                  e.printStackTrace();
                  return null;
              }
          }
  
          int nextInt() {
              return Integer.parseInt(next());
          }
  
          int[] readArray(int n) {
              int[] a = new int[n];
              for (int i = 0; i < n; i++) a[i] = nextInt();
              return a;
          }
  
          long[] readArrayLong(int n) {
              long[] a = new long[n];
              for (int i = 0; i < n; i++) a[i] = nextLong();
              return a;
          }
  
          long nextLong() {
              return Long.parseLong(next());
          }
  
          @Override
          public void close() throws Exception {
              out.flush();
              out.close();
              br.close();
          }
      }
  }
  