#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

string U="NWSE";

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        int N;cin>>N;
        vii A(N);
        for(int i=0;i<N;i++){
            char c;cin>>c;
            int x;cin>>x;
            for(int j=0;j<4;j++){
                if(U[j]==c) A[i].fi=j;
            }
            A[i].se=x;
        }
        cout<<2*N-1<<" "<<U[A[0].fi]<<"\n";
        for(int i=0;i<N;i++){
            if(i){
                if((A[i-1].fi+1)%4==A[i].fi) cout<<"L\n";
                else cout<<"R\n";
            }
            cout<<"Z "<<A[i].se<<"\n";
        }
    }
}