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.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.io.PrintWriter;
  import java.util.*;
  
  import static java.lang.Math.*;
  
  public class Main {
  
      public static void main(String[] args) {
          FastScanner fs=new FastScanner();
          Scanner sc = new Scanner(System.in);
          PrintWriter out = new PrintWriter(System.out);
          int n = fs.nextInt();
          for (int i = 0; i < n; i++) {
              String s = fs.next();
              int cnt = 0;
              for (int j = 0; j < s.length(); j++) {
                  if(s.charAt(j) == 'N') cnt++;
              }
              if(cnt == 1) System.out.println("NO");
              else System.out.println("YES");
          }
      }
  
      public static void swap(Pair[] a,int i, int j){
          Pair temp = a[i];
          a[i] = a[j];
          a[j] = temp;
      }
  
      public static void print(Pair[] a){
          for (Pair arr: a) {
              System.out.print(arr.b  +" ");
          }
          System.out.println();
      }
  
      public static int lcd(int a,int b){
          return a*b/gcd(a,b);
      }
  
      public static int gcd(int a, int b){
          if(b == 0){
              return a;
          }
          return gcd(b,a % b);
      }
  
      public static boolean isPerfectSquare(int n){
          int sqr = (int)sqrt(n);
          return sqr * sqr == n;
      }
  
  
      public static boolean isPrime(int x){
          int a = (int)sqrt(x);
  
          for(int i = 2; i<=a ; i++){
              if(x % i == 0) return false;
          }
          return true;
      }
  
      static void sort(int[] a) {
          ArrayList<Integer> l=new ArrayList<>();
          for (int i:a) l.add(i);
          Collections.sort(l);
          for (int i=0; i<a.length; i++) a[i]=l.get(i);
      }
  
      static class FastScanner {
          BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
          StringTokenizer st=new StringTokenizer("");
          String next() {
              while (!st.hasMoreTokens())
                  try {
                      st=new StringTokenizer(br.readLine());
                  } catch (IOException e) {
                      e.printStackTrace();
                  }
              return st.nextToken();
          }
  
  
          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 nextLong() {
              return Long.parseLong(next());
          }
      }
  
      static class Pair implements Comparable
      {
          int a,b;
          public String toString() {
              return a+"  " + b;
          }
  
          public Pair(int x , int y) {
              a=x;b=y;
          }
          @Override
          public int compareTo(Object o) {
              Pair p = (Pair)o;
              if(p.a < a)
                  return 1;
              else
              if(p.a==a)
                  if(p.b<b)
                      return 1;
                  else if(p.b==b)
                      return 0;
              return -1;
          }
      }
  
  }
  