#include <bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define all(v) (v).begin(), (v).end()

bool chmin(auto &a, auto b) { return (b < a) and (a = b, true); }
bool chmax(auto &a, auto b) { return (a < b) and (a = b, true); }

using i64 = long long;

void solve() {
    const vector<pair<int, int>> dirs{
        {0, 1}, // N
        {1, 0}, // E
        {0, -1}, // S
        {-1, 0}, // W
    };

    auto getd = [&](char c) {
        return string{"NESW"}.find(c);
    };

    int op;
    cin >> op;
    vector<pair<char, int>> ans;
    int cur = -1;
    int st = -1;
    while (op--) {
        char c;
        int d;
        cin >> c >> d;
        if (cur == -1) {
            st = getd(c);
            cur = getd(c);
        } else {
            int dif = (getd(c) - cur + 4) % 4;
            assert(dif != 2);
            if (dif == 1) {
                ans.push_back({'R', -1});
            } else if (dif == 3) {
                ans.push_back({'L', -1});
            }
            cur = getd(c);
        }
        ans.push_back({'Z', d});
    }

    cout << ans.size() << ' ' << "NESW"[st] << '\n';
    for (auto [a, b] : ans) {
        if (b == -1) {
            cout << a << '\n';
        } else {
            cout << a << ' ' << b << '\n';
        }
    }
}


signed main() {
    cin.tie(0)->sync_with_stdio(false);
    cin.exceptions(cin.failbit);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}