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

const int N=100;

int n;
string s[N];
int t[N];
char face;
map<pair<char,char>,char> mp={{{'S','E'},'L'},{{'S','W'},'R'},{{'N','E'},'R'},{{'N','W'},'L'},{{'E','S'},'R'},{{'E','N'},'L'},{{'W','S'},'L'},{{'W','N'},'R'}};

vector<pair<char,int>> ans;

void solve(){
    
    cin>>n;
    ans.clear();
    for(int i=1;i<=n;i++){
        cin>>s[i]>>t[i];
    }
    face=s[1][0];
    for(int i=1;i<=n;i++){
        ans.push_back({'Z',t[i]});
        if(i!=n){
            ans.push_back({mp[{s[i][0],s[i+1][0]}],0});
        }
    }

    cout<<ans.size()<<" "<<face<<"\n";
    for(auto [x,y]:ans){
        if(y) cout<<x<<" "<<y<<"\n";
        else cout<<x<<"\n";
    }

}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n=1;
    cin>>n;
    while(n--)solve();
    return 0;
}