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 {
  
      public static void main(String args[]) throws IOException {
  
          FastReader sc = new FastReader();
          PrintWriter out = new PrintWriter(System.out);
  
          int tc, i, j;
          String s;
          char p;
  
          tc = sc.nextInt();
          while (tc-- > 0) {
              s=sc.nextLine();
              char arr[]=s.toCharArray();
              int n=s.length();
              int count=0;
              for (i = 0; i < n; i++) {
                  if (arr[i]=='N')
                      count++;
  
              }
              if (count!=1)
              out.println("YES");
              else
                  out.println("NO");
          }
          out.close();
      }
  	
  
  
  /*--------------------------------------------------------
  ----------------------------------------------------------*/
  
  
      //Pair Class
  
      public static class Pair implements Comparable<Pair> {
          int x, y;
  
          Pair(int x, int y) {
              this.x = x;
              this.y = y;
          }
  
          @Override
          public int compareTo(Pair o) {
              return this.x - o.x;
          }
      }
  
      /*
  		FASTREADER
  	*/
      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;
          }
  
          /*DEFINED BY ME*/
  
          //READING ARRAY
          int[] readArray(int n) {
              int arr[] = new int[n];
              for (int i = 0; i < n; i++)
                  arr[i] = nextInt();
              return arr;
          }
  
          //COLLECTIONS SORT
          void sort(int arr[]) {
              ArrayList<Integer> l = new ArrayList<>();
              for (int i : arr)
                  l.add(i);
              Collections.sort(l);
              for (int i = 0; i < arr.length; i++)
                  arr[i] = l.get(i);
          }
  
          //EUCLID'S GCD
          int gcd(int a, int b) {
              if (b != 0)
                  return gcd(b, a % b);
              else
                  return a;
          }
  
          void swap(int arr[], int i, int j) {
              int temp = arr[i];
              arr[i] = arr[j];
              arr[j] = temp;
          }
      }
  }