#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define lowbit(x) (x&(-x))
#define ull unsigned long long 
#define pii pair<int,int>
using namespace std;
const string yes="Yes\n",no="No\n";
const int N = 1000005,inf = 2e18,mod=1000000007;
int qpow(int x,int y=mod-2,int mo=mod,int res=1){
    for(;y;(x*=x)%=mo,y>>=1)if(y&1)(res*=x)%=mo;
    return res;
}
int jie[N],invjie[N];
int C(int n,int m){return n>=m&&m>=0?jie[n]*invjie[m]%mod*invjie[n-m]%mod:0;}
void main_init(){
    int n=N-1;jie[0]=1;for(int i=1;i<=n;i++)jie[i]=jie[i-1]*i%mod;
    invjie[n]=qpow(jie[n]);for(int i=n-1;~i;i--)invjie[i]=invjie[i+1]*(i+1)%mod;
}
int n;
string s[15];
int a[15];
string t[]={"S","W","N","E"};
int getid(string x){
    for(int i=0;i<4;i++){
        if(t[i]==x)return i;
    }
}
void solve(){
    cin>>n;
    vector<pair<string,int>>ans;
    for(int i=1;i<=n;i++){
        cin>>s[i]>>a[i];
        s[0]=s[1];
        if(s[i]!=s[i-1]){
            int x=getid(s[i-1]),y=getid(s[i]);
            if(y==(x+1)%4){
                ans.push_back({"R",0});
            }
            else{
                ans.push_back({"L",0});
            }
        }
        ans.push_back({"Z",a[i]});
    }


    cout<<ans.size()<<" "<<s[1]<<endl;
    for(auto [x,y]:ans){
        if(x=="Z")cout<<x<<" "<<y<<endl;
        else cout<<x<<endl;
    }

}
signed main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cout<<fixed<<setprecision(12);main_init();
    int t=1;
    cin>>t;
    while (t--)solve();
}