#include <iostream>
 #include <iomanip>
 #include <cmath>
 #include <algorithm>
 #include <cstdlib>
 #include <limits.h>
 #include <string>

 #define ll long long
 #define pi 3.141592653

 using namespace std;
 void Fast_IO();
 void Rofyda_Elghadban(){
   #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
    #endif
}

 /*ll gcd(ll num1,ll num2){
  while(num2!=0){
    ll temp=num1;
    num1=num2;
    num2=temp%num1;
  }
  return num1;
 }

 ll lcm(ll num1,ll num2){
  return(num1/gcd(num1,num2))*num2;
 }*/

 bool prime(ll n){
  if(n<2){
    return false;
  }for(ll i=2;i<=sqrt(n);i++){
    if(n%i==0){
      return false;
    }
  }return true;
 }

 void binary(ll n){
  ll x=n;
  string s="";
  while(n>0){
  if(n%2==0){
    s+=to_string(0);
  }else{
    s+=to_string(1);
  }
  n/=2;
  }
  ll sum=0;
  for(int i=0;i<s.size();i++){
    sum+=s[i]-'0';
  }if(x%sum==0){
    cout<<"YES"<<endl;
  }else{
    cout<<"NO"<<endl;
  }
  }
int main()
 {   Rofyda_Elghadban();
 //Fast_IO();
 //freopen("input.txt","r",stdin);
 //freopen("output.txt","r",stdout);
 int t;
 cin>>t;
 int d=1,directionl,directionr,num1,num2;
 char temp='E';
 while(t--){
  int n;
  cin>>n;
  string s;
  cin>>s;
  for(int i=0;i<s.size();i++){
    if(s[i]=='1'){
      directionl=((d-n)%4+4)%4;
    }else if(s[i]=='0'){
      directionr=((d-n)%4+4)%4;
    }
  }if(directionl==directionr){
    cout<<"E"<<endl;
  }else if(directionl>directionr){
    num1=directionl-directionr;
  }else if(directionr>directionl){
    num2=directionr-directionl;
  }
  if((num1%4)==1){
    cout<<"N"<<endl;
  }else if((num1%4)==2){
    cout<<"W"<<endl;
  }else if((num1%4)==3){
    cout<<"S"<<endl;
  }else if((num1%4)==0){
    cout<<"E"<<endl;
  }
  if((num2%4)==1){
    cout<<"S"<<endl;
  }else if((num2%4)==2){
    cout<<"W"<<endl;
  }else if((num2%4)==3){
    cout<<"N"<<endl;
  }else if((num2%4)==0){
    cout<<"E"<<endl;
  }

 }



 return 0;
 }