A. Equal or Not Equal
tags: constructive algorithms dsu implementation *800
solution:
code:
#include<bits/stdc++.h>
using namespace std;
int t;
string s;
int main(){
cin>>t;
while(t--){
cin>>s;
cout<<(count(s.begin(),s.end(),'N')==1