#include <bits/stdc++.h>
using namespace std;

#define ll long long

map<pair<char,char>,char> m;

void solve(){
    int n;
    cin>>n;
    vector<pair<char,int>> v;
    char dir='S';
    for(int i=1;i<=n;i++){
        char c;
        int num;
        cin>>c>>num;
        if(c==dir){
            v.push_back({'Z',num});
        }
        else{
            v.push_back({m[{dir,c}],0});
            dir=c;
            v.push_back({'Z',num});
        }
    }
    cout<<v.size()<<" S"<<'\n';
    for(auto x:v){
        if(x.second!=0){
            cout<<x.first<<" "<<x.second<<'\n';
        }
        else{
            cout<<x.first<<'\n';
        }
    }
}

int main()
{
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    m.insert({{'N','E'},'R'});
    m.insert({{'N','W'},'L'});
    m.insert({{'E','S'},'R'});
    m.insert({{'E','N'},'L'});
    m.insert({{'S','W'},'R'});
    m.insert({{'S','E'},'L'});
    m.insert({{'W','N'},'R'});
    m.insert({{'W','S'},'L'});
    int t;
    cin>>t;
    while(t--){
        solve();
    }
}