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

struct node {
    char op;
    int x;
};

void solve() {
    int n;
    cin >> n;
    vector<node>a(n + 1);
    for (int i = 1;i <= n;i++) {
        cin >> a[i].op >> a[i].x;
    }

    auto get = [&](char x, char y) {
        if (x == 'N' and y == 'E')return 'R';
        if (x == 'N' and y == 'W')return 'L';
        if (x == 'E' and y == 'S')return 'R';
        if (x == 'E' and y == 'N')return 'L';
        if (x == 'S' and y == 'W')return 'R';
        if (x == 'S' and y == 'E')return 'L';
        if (x == 'W' and y == 'N')return 'R';
        if (x == 'W' and y == 'S')return 'L';
        return 'L';
    };

    vector<node>ans;
    ans.push_back({ 'Z',a[1].x });
    for (int i = 2;i <= n;i++) {
        ans.push_back({ get(a[i - 1].op,a[i].op),-1 });
        ans.push_back({ 'Z',a[i].x });
    }
    cout << ans.size() << " " << a[1].op << "\n";
    for (auto [x, y] : ans) {
        if (y == -1) {
            cout << x << "\n";
        }
        else {
            cout << x << " " << y << "\n";
        }

    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T = 1;
#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif
    cin >> T;
    while (T--)
        solve();
    return 0;
}