#include<bits/stdc++.h>

using namespace std;

#define ull unsigned long long
#define ll long long
#define lowbit(x) (x)&(-x)
//#define int long long
//#define double long double 
const int N = 1e6 + 5;
const ll base = 131;
const ll mod = 998244353;

void solve() {
    int n;
    cin>>n;
    vector<pair<char,int>>w(n+1);
    for(int i=1;i<=n;++i) cin>>w[i].first>>w[i].second;
    vector<pair<char,int>>as;
    char now=w[1].first;
    for(int i=1;i<=n;++i){
        if(now!=w[i].first){
            if(now=='N'){
                if(w[i].first=='W') as.push_back({'L',0});
                else as.push_back({'R',0});
            }
            if(now=='S'){
                if(w[i].first=='E') as.push_back({'L',0});
                else as.push_back({'R',0});
            }
            if(now=='E'){
                if(w[i].first=='N') as.push_back({'L',0});
                else as.push_back({'R',0});
            }
            if(now=='W'){
                if(w[i].first=='S') as.push_back({'L',0});
                else as.push_back({'R',0});
            }
        }
        as.push_back({'Z',w[i].second});
    }
    cout<<as.size()<<" "<<w[1].first<<'\n';
    for(auto &[u,v]:as){
        if(v) cout<<u<<" "<<v<<'\n';
        else cout<<u<<'\n';
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--) solve();
}