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: /**
   * A_Equal_or_Not_Equal
   */
  
   import java.util.*;
   import java.io.*;
  
  public class A_Equal_or_Not_Equal {
  
      static class FastReader {
          BufferedReader br;
          StringTokenizer st;
   
          public FastReader()
          {
              br = new BufferedReader(
                  new InputStreamReader(System.in));
          }
   
          String next()
          {
              while (st == null || !st.hasMoreElements()) {
                  try {
                      st = new StringTokenizer(br.readLine());
                  }
                  catch (IOException e) {
                      e.printStackTrace();
                  }
              }
              return st.nextToken();
          }
   
          int nextInt() { return Integer.parseInt(next()); }
   
          long nextLong() { return Long.parseLong(next()); }
   
          double nextDouble()
          {
              return Double.parseDouble(next());
          }
   
          String nextLine()
          {
              String str = "";
              try {
                  str = br.readLine();
              }
              catch (IOException e) {
                  e.printStackTrace();
              }
              return str;
          }
      }
  
      public static void main(String[] args) throws Exception{
          FastReader fr = new FastReader();
          int t = fr.nextInt();
          while (t-->0) {
              String s = fr.nextLine();
  
              // int[] arr = new int[s.length()];
             
              
              if(s.length()==2 && (s.charAt(0)!=s.charAt(1)))
              {
                  System.out.println("NO");
                  continue;
              }
  
              if(s.length()==3 && (s.equals("EEN") || s.equals("NEE")))
              {
                  System.out.println("NO");
                  continue;
              }
  
              int indx1 = s.indexOf("ENE");
              int indx2 = s.indexOf("EEN");
              int indx3 = s.indexOf("NEE");
  
  
              boolean flag1 = true;
              if(indx1!=-1)
              {
                  flag1 = check(s,indx1);
              }
  
              boolean flag2 = true;
  
              if(indx2!=-1)
              {
                  flag2 = check(s,indx2);
              }
  
              boolean flag3 = true;
  
              if(indx3!=-1)
              {
                  flag3 = check(s,indx3);
              }
  
              if(flag1&&flag2&&flag3)
              {
                  System.out.println("YES");
              }else{
                  System.out.println("NO");
              }
  
  
          //     int indx1 = indx+3;
          //     int indx2 = indx-1;
             
          //     if(indx!=-1)
          //     {
          //     while (indx1!=-1 && indx1<s.length()) {
  
          //         if(s.charAt(indx1)=='N')
          //         {
          //             flag = true;
          //             break;
          //         }
          //         indx1++;
                  
          //     }
  
          //     while (indx2>=0) {
          //         if(s.charAt(indx2)=='N')
          //         {
          //             flag2 = true;
          //             break;
          //         }
          //         indx2--;
          //     }
  
          //     if(flag||flag2)
          //     {
          //         System.out.println("YES");
          //     }else{
          //         System.out.println("NO");
          //     }
          // }else
          // {
          //     System.out.println("YES");
          }
  
              
  
          }
      static boolean check(String s,int indx)
      {
          int indx1 = indx+3;
          int indx2 = indx-1;
          boolean flag1 = false;
          boolean flag2 = false;
  
          while(indx1<s.length())
          {
              if(s.charAt(indx1)=='N')
              {
                  flag1 = true;
                  break;
              }
              indx1++;
          }
  
          while (indx2>=0) {
              if(s.charAt(indx2)=='N')
              {
                  flag2 = true;
                  break;
              }
              indx2--;
          }
  
          return flag1||flag2;
      }
  }