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

// 0 N
// 1 E
// 2 S
// 3 W

map<char, int> mp;

void solve() {
    int n;
    cin >> n;
    vector<array<int, 2>> vec;
    for (int i = 0 ; i < n ; i++) {
        char s;
        cin >> s;
        int x;
        cin >> x;
        vec.push_back({mp[s], x});
    }
    auto left = [&](int x) {
        return (x + 3) % 4;
    };
    auto right = [&](int x) {
        return (x + 1) % 4;
    };
    int d = (vec[0][0]);
    vector<pair<char, int>> ans;
    for (auto &[x, y] : vec) {
        if (left(d) == x) {
            ans.push_back({'L', 0});
            d = left(d);
        } else if (right(d) == x) {
            ans.push_back({'R', 0});
            d = right(d);
        }
        ans.push_back({'Z', y});
    }
    cout << ans.size() << " ";
    d = (vec[0][0]);
    if (d == 0) cout << "N";
    if (d == 1) cout << "E";
    if (d == 2) cout << "S";
    if (d == 3) cout << "W";
    cout << "\n";
    for (auto &[x, y] : ans) {
        cout << x;
        if (y != 0) cout << " " << y;
        cout << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    mp['N'] = 0;
    mp['E'] = 1;
    mp['S'] = 2;
    mp['W'] = 3;
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}