#include <bits/stdc++.h>

using namespace std;

typedef long long i64;
typedef unsigned long long u64;
typedef double lf;

map<pair<char, char>, char> turns = {
    {{'N', 'E'}, 'R'},
    {{'N', 'W'}, 'L'},
    {{'E', 'N'}, 'L'},
    {{'E', 'S'}, 'R'},
    {{'W', 'N'}, 'R'},
    {{'W', 'S'}, 'L'},
    {{'S', 'E'}, 'L'},
    {{'S', 'W'}, 'R'}
};

void solve() {
    int n;
    cin >> n;
    vector<pair<char, int>> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first >> a[i].second;
    }
    char curdir = a[0].first;
    vector<string> ans;
    for (int i = 0; i < n; ++i) {
        ans.push_back("Z " + to_string(a[i].second));
        if (i != n - 1) {
            ans.push_back(string(1, turns[{curdir, a[i + 1].first}]));
            curdir = a[i + 1].first;
        }
    }

    cout << ans.size() << " " << a[0].first << '\n';
    for (const string &s : ans) {
        cout << s << '\n';
    }
}

signed main() {
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
#endif
    ios_base::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    for (int i = 0; i < t; i++) {
        solve();
    }
}