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.util.*;
  import java.io.*;
  import java.lang.*;
  
  // Problem - Multiples of 3 onn codeforces MNedium difficulty level 
  // or check on youtube channel CodeNCode
  
  public class Problem {
       static int Mod = 1000000007;
      static long dp[][];
      static int g[][];
      static int fact[];
  
  
      public static void main(String[] args) {
          MyScanner scan = new MyScanner();
          PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out));
           int t = scan.nextInt();
          // int t = 1;
          while (t-- > 0) {
                
                  char a[]= scan.nextLine().toCharArray();
                  int n= a.length;
                  int count=0;
                  for(int i=0;i<n;i++){
                    if(a[i]=='N') count++;
                  }
  
                  if(count==1) out.println("NO");
                  else out.println("YES");
                
          }
  
          out.close();
      }
  
   
  
  
  
      static ArrayList<Integer> digits(int n){
          ArrayList<Integer> list= new ArrayList<>();
          while(n>0){
              list.add(n%10);
              n=n/10;
          }
          Collections.reverse(list);
          return list;
      }
  
      static class Pair {
          int l;
          int r;
  
          Pair(int l, int r) {
              this.l = l;
              this.r = r;
          }
  
          @Override
          public int hashCode() {
              final int prime = 31;
              int result = 1;
              result = prime * result + l;
              result = prime * result + r;
              return result;
          }
  
          @Override
          public boolean equals(Object obj) {
              if (this == obj)
                  return true;
              if (obj == null)
                  return false;
              if (getClass() != obj.getClass())
                  return false;
              Pair other = (Pair) obj;
              if (l != other.l)
                  return false;
              if (r != other.r)
                  return false;
              return true;
          }
  
          @Override
          public String toString() {
              return "Pair [l=" + l + ", r=" + r + "]";
          }
  
      }
  
      public static void reverse(int a[]) {
          int n = a.length;
          for (int i = 0; i < n / 2; i++) {
              int temp = a[i];
              a[i] = a[n - i - 1];
              a[n - i - 1] = temp;
          }
      }
  
      public static void sort(int[] array) {
          ArrayList<Integer> copy = new ArrayList<>();
          for (Integer i : array)
              copy.add(i);
          Collections.sort(copy);
          for (int i = 0; i < array.length; i++)
              array[i] = copy.get(i);
      }
  
      public static void sort(long[] array) {
          ArrayList<Long> copy = new ArrayList<>();
          for (Long i : array)
              copy.add(i);
          Collections.sort(copy);
          for (int i = 0; i < array.length; i++)
              array[i] = copy.get(i);
      }
  
      public static long gcd(long a, long b) {
          if (b == 0)
              return a;
          return gcd(b, a % b); // gcd(a,b) = gcd(a-b,b) or gcd(a,b) = gcd(b,a%b) where a>b
      }
  
      public static int gcd(int a, int b) {
          if (b == 0)
              return a;
          return gcd(b, a % b); // gcd(a,b) = gcd(a-b,b) or gcd(a,b) = gcd(b,a%b) where a>b
      }
  
      public static long lcm(long a, long b) {
          return (a / gcd(a, b)) * b;
      }
  
      static long power(long x, long y) {
          long temp;
          if (y == 0) // a^b= (a^b/2)^2 if b is even
              return 1; // = (a*a^(b-1)) if b is odd
          temp = power(x, y / 2);
          if (y % 2 == 0)
              return temp * temp;
          else
              return x * temp * temp;
      }
  
      static long mod(long x) {
          return ((x % Mod + Mod) % Mod);
      }
  
      static long add(long a, long b) {
          return mod(mod(a) + mod(b));
      }
  
      static int mod(int x) {
          return ((x % Mod + Mod) % Mod);
      }
  
      static int add(int a, int b) {
          return mod(mod(a) + mod(b));
      }
  
      static int sub(int a, int b) {
          return mod(mod(a) - mod(b) + Mod);
      }
  
      static long mul(long a, long b) {
          return mod(mod(a) * mod(b));
      }
  
      static long pow(long x, long y, long p) {
          long res = 1; // Initialize result
          x = x % p; // Update x if it is more than or equal to p
  
          if (x == 0)
              return 0; // In case x is divisible by p;
  
          while (y > 0) {
              // If y is odd, multiply x with result
              if ((y & 1) != 0)
                  res = (res * x) % p;
  
              // y must be even now
              y = y >> 1; // y = y/2
              x = (x * x) % p;
          }
          return res;
      }
  
      static long modInverse(long a, long m) {
          // int g = gcd(a, m);
          // if (g != 1)
          // System.out.println("Inverse doesn't exist");
          // else {
          // // If a and m are relatively prime, then modulo
          // // inverse is a^(m-2) mode m
          // return power(a, m - 2, m);
          // }
          return pow(a, m - 2, m);
      }
  
  }
  
  class MyScanner {
      BufferedReader br;
      StringTokenizer st;
  
      public MyScanner() {
          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;
      }
  
  }
  