#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
#define ALL(v) v.begin(),v.end()
#define For(i,_) for(int i=0,i##end=_;i<i##end;++i) // [0,_)
#define FOR(i,_,__) for(int i=_,i##end=__;i<i##end;++i) // [_,__)
#define Rep(i,_) for(int i=(_)-1;i>=0;--i) // [0,_)
#define REP(i,_,__) for(int i=(__)-1,i##end=_;i>=i##end;--i) // [_,__)
typedef long long ll;
typedef unsigned long long ull;
#define V vector
#define pb push_back
#define pf push_front
#define qb pop_back
#define qf pop_front
#define eb emplace_back
typedef pair<int,int> pii;
typedef pair<ll,int> pli;
#define fi first
#define se second
const int dir[4][2]={{-1,0},{0,1},{1,0},{0,-1}},inf=0x3f3f3f3f,mod=1e9+7;
const ll infl=0x3f3f3f3f3f3f3f3fll;
template<class T>inline bool ckmin(T &x,const T &y){return x>y?x=y,1:0;}
template<class T>inline bool ckmax(T &x,const T &y){return x<y?x=y,1:0;}
int init=[](){return cin.tie(nullptr)->sync_with_stdio(false),0;}();
int main(){
    int t_case=1;
    scanf("%d",&t_case);
    while(t_case--){
        int n;
        scanf("%d",&n);
        V<pii>ans;
        int f=-1;
        char g=-1;
        while(n--){
            char c;
            while(!isupper(c=getchar()));
            int x;
            scanf("%d",&x);
            int y=(c=='N'?0:c=='E'?1:c=='S'?2:3);
            if(~f){
                if(y==((f+1)&3))ans.eb('R',-1);
                else ans.eb('L',-1);
            }
            else g="NESW"[y];
            f=y;
            ans.eb('Z',x);
        }
        assert(~g);
        printf("%d %c\n",(int)ans.size(),g);
        for(const pii &i:ans){
            if(i.fi=='Z')printf("%c %d\n",i.fi,i.se);
            else printf("%c\n",i.fi);
        }
    }
    return 0;
}