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: //package currentContest;
  
  import java.io.BufferedReader;
  import java.io.IOException;
  import java.io.InputStreamReader;
  import java.util.ArrayDeque;
  import java.util.ArrayList;
  import java.util.Arrays;
  import java.util.HashMap;
  import java.util.Random;
  import java.util.StringTokenizer;
  
  
  public class P1 {
  	public static void main(String[] args) {
  		// TODO Auto-generated method stub
  		FastReader sc=new FastReader();
  		int t=sc.nextInt();
  		StringBuilder st=new StringBuilder();
  		while(t--!=0){
  			String s=sc.nextLine();
  			int count=0;
  			for(int i=0;i<s.length();i++) {
  				if(s.charAt(i)=='N') {
  					count++;
  				}
  			}
  			if(count==1) {
  				st.append("NO\n");
  			}else {
  				st.append("YES\n");
  			}
  		}
  		System.out.println(st);
  	}
  	
  	static class DisjointUnionSets {
  		int[] rank, parent;
  		int n;
  		
  		// Constructor
  		public DisjointUnionSets(int n)
  		{
  			rank = new int[n];
  			parent = new int[n];
  			this.n = n;
  			makeSet();
  		}
  		
  		// Creates n sets with single item in each
  		void makeSet()
  		{
  			for (int i = 0; i < n; i++) {
  				// Initially, all elements are in
  				// their own set.
  				parent[i] = i;
  			}
  		}
  		
  		// Returns representative of x's set
  		int find(int x)
  		{
  			// Finds the representative of the set
  			// that x is an element of
  			if (parent[x] != x) {
  				// if x is not the parent of itself
  				// Then x is not the representative of
  				// his set,
  				parent[x] = find(parent[x]);
  				
  				// so we recursively call Find on its parent
  				// and move i's node directly under the
  				// representative of this set
  			}
  			
  			return parent[x];
  		}
  		
  		// Unites the set that includes x and the set
  		// that includes x
  		void union(int x, int y)
  		{
  			// Find representatives of two sets
  			int xRoot = find(x), yRoot = find(y);
  			
  			// Elements are in the same set, no need
  			// to unite anything.
  			if (xRoot == yRoot)
  				return;
  			
  			// If x's rank is less than y's rank
  			if (rank[xRoot] < rank[yRoot])
  				
  				// Then move x under y  so that depth
  				// of tree remains less
  				parent[xRoot] = yRoot;
  			
  			// Else if y's rank is less than x's rank
  			else if (rank[yRoot] < rank[xRoot])
  				
  				// Then move y under x so that depth of
  				// tree remains less
  				parent[yRoot] = xRoot;
  			
  			else // if ranks are the same
  			{
  				// Then move y under x (doesn't matter
  				// which one goes where)
  				parent[yRoot] = xRoot;
  				
  				// And increment the result tree's
  				// rank by 1
  				rank[xRoot] = rank[xRoot] + 1;
  			}
  		}
  	}
  
  	static FastReader sc = new FastReader();
  
  	public static void solvegraph() {
  		int n = sc.nextInt();
  
  		int edge[][] = new int[n - 1][2];
  		for (int i = 0; i < n - 1; i++) {
  			edge[i][0] = sc.nextInt() - 1;
  			edge[i][1] = sc.nextInt() - 1;
  		}
  		ArrayList<ArrayList<Integer>> ad = new ArrayList<>();
  		for (int i = 0; i < n; i++) {
  			ad.add(new ArrayList<Integer>());
  		}
  		for (int i = 0; i < n - 1; i++) {
  			ad.get(edge[i][0]).add(edge[i][1]);
  			ad.get(edge[i][1]).add(edge[i][0]);
  		}
  		int parent[] = new int[n];
  		Arrays.fill(parent, -1);
  		parent[0] = n;
  		ArrayDeque<Integer> queue = new ArrayDeque<>();
  		queue.add(0);
  		int child[] = new int[n];
  		Arrays.fill(child, 0);
  		ArrayList<Integer> lv = new ArrayList<Integer>();
  		while (!queue.isEmpty()) {
  			int toget = queue.getFirst();
  			queue.removeFirst();
  			child[toget] = ad.get(toget).size() - 1;
  			for (int i = 0; i < ad.get(toget).size(); i++) {
  				if (parent[ad.get(toget).get(i)] == -1) {
  					parent[ad.get(toget).get(i)] = toget;
  					queue.addLast(ad.get(toget).get(i));
  				}
  			}
  			lv.add(toget);
  		}
  
  		child[0]++;
  	}
  
  	static void sort(int[] A) {
  		int n = A.length;
  		Random rnd = new Random();
  		for (int i = 0; i < n; ++i) {
  			int tmp = A[i];
  			int randomPos = i + rnd.nextInt(n - i);
  			A[i] = A[randomPos];
  			A[randomPos] = tmp;
  		}
  		Arrays.sort(A);
  	}
  	static void sort(char[] A) {
  		int n = A.length;
  		Random rnd = new Random();
  		for (int i = 0; i < n; ++i) {
  			char tmp = A[i];
  			int randomPos = i + rnd.nextInt(n - i);
  			A[i] = A[randomPos];
  			A[randomPos] = tmp;
  		}
  		Arrays.sort(A);
  	}
  
  	static void sort(long[] A) {
  		int n = A.length;
  		Random rnd = new Random();
  		for (int i = 0; i < n; ++i) {
  			long tmp = A[i];
  			int randomPos = i + rnd.nextInt(n - i);
  			A[i] = A[randomPos];
  			A[randomPos] = tmp;
  		}
  		Arrays.sort(A);
  	}
  
  	static String sort(String s) {
  		Character ch[] = new Character[s.length()];
  		for (int i = 0; i < s.length(); i++) {
  			ch[i] = s.charAt(i);
  		}
  		Arrays.sort(ch);
  		StringBuffer st = new StringBuffer("");
  		for (int i = 0; i < s.length(); i++) {
  			st.append(ch[i]);
  		}
  		return st.toString();
  	}
  
  	public static long gcd(long a, long b) {
  		if (a == 0) {
  			return b;
  		}
  		return gcd(b % a, a);
  	}
  
  	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;
  		}
  	}
  }
  