#include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define pb push_back
void debug() {std::cerr << "\n";}
template<class T, class... OtherArgs>
void debug(T &&var, OtherArgs &&... args) {
    std::cerr << std::forward<T>(var) << " ";
    debug(std::forward<OtherArgs>(args)...);
}
#define SZ(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
using i64 = long long;
using u64 = unsigned long long;
using LD = long double;
using PII = pair<int, int>;
constexpr int N = 300010;
constexpr int P = 1e9 + 7;

void solve() {
    int n;
    cin >> n;
    vector<pair<char, int>> op(n);
    for (int i = 0; i < n; i++) {
        auto &[c, x] = op[i];
        cin >> c >> x;
    }

    int cnt = 0;
    string dir = "NWSE";
    int d, inid;
    for (int i = 0; i < 4; i++) {
        if (op[0].x == dir[i]) {
            inid = d = i;
            break;
        }
    }
    vector<pair<char, int>> res;
    for (int i = 0; i < n; i++) {
        auto &[c, x] = op[i];
        if (c != dir[d]) {
            if (dir[(d + 3) % 4] == c) {
                d = (d + 3) % 4;
                res.pb({'R', 0});
            } else if (dir[(d + 1) % 4] == c) {
                d = (d + 1) % 4;
                res.pb({'L', 0});
            } else {
                assert(0);
            }
        }
        if (SZ(res) && res.back().x == 'Z') {
            res.back().y += x;
        } else {
            res.pb({'Z', x});
        }
    }

    cout << SZ(res) << ' ' << dir[inid] << '\n';
    for (auto &[c, x] : res) {
        if (c == 'L' || c == 'R') {
            cout << c << '\n';
        } else {
            cout << c << ' ' << x << '\n';
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(20);
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }
}