#include <bits/stdc++.h>
#define endl '\n' 
using namespace std;
#pragma GCC optimize("O3")
typedef long long LL;

const int N = 2e5 + 10;
const LL mod = 1e9 + 7;
using PII = pair<int, int>;

map<char, map<char, char>> mp;

void solve()
{
    int n; cin >>n;
    char st;
    char dir;
    vector<pair<char, int>> ans;
    {
        cin >>dir;
        st = dir;
        int x; cin >>x;
        ans.push_back({'Z', x});
    }
    for(int i = 2; i <= n; i++)
    {
        char to; int x;
        cin >>to >>x;
        ans.push_back({mp[dir][to], -1});
        ans.push_back({'Z', x});
        dir = to;
    }
    cout <<ans.size() <<' ' <<st <<endl;
    for(auto [x, y] : ans)
    {
        if(y == -1)
        {
            cout <<x <<endl;
        }
        else  
        {
            cout <<x <<' ' <<y <<endl;
        }
    }
}

signed main ()
{
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);

    mp['N']['N'] = 'Z';
    mp['N']['E'] = 'R';
    mp['N']['W'] = 'L';
    mp['S']['S'] = 'Z';
    mp['S']['E'] = 'L';
    mp['S']['W'] = 'R';
    mp['E']['E'] = 'Z';
    mp['E']['N'] = 'L';
    mp['E']['S'] = 'R';
    mp['W']['W'] = 'Z';
    mp['W']['S'] = 'L';
    mp['W']['N'] = 'R';
    int T; cin >>T;
    while(T--)
    {
        solve();
    }

    return 0;
}