#include<bits/stdc++.h>
using namespace std;
// #pragma GCC optimize(3)
#define int long long

// std::mt19937_64 rng {std::chrono::steady_clock::now().time_since_epoch().count()};

int n;

inline void solve(){
    cin>>n;

    vector<char>a(n+1);
    vector<int>b(n+1);
    for(int i=1;i<=n;i++)cin>>a[i]>>b[i];
    
    cout<<2*n-1<<" "<<a[1]<<"\n";

    char now=a[1];
    for(int i=1;i<=n;i++){
        if(i!=1){
            if(now=='S'){
                if(a[i]=='E')cout<<"L\n";
                else cout<<"R\n"; 
            }else if(now=='W'){
                if(a[i]=='S')cout<<"L\n";
                else cout<<"R\n";
            }else if(now=='E'){
                if(a[i]=='N')cout<<"L\n";
                else cout<<"R\n";
            }else{
                if(a[i]=='W')cout<<"L\n";
                else cout<<"R\n";
            }
        }

        cout<<"Z "<<b[i]<<"\n";
        now=a[i];   
    }
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    // cout<<setiosflags(ios::fixed)<<setprecision(10);

    int _=1;
    cin>>_;
    while(_--){
        solve();
    }
    return 0;
}