#include <bits/stdc++.h>
using namespace std;
struct fio {
    char gc() {return getchar();}
    template <typename T> void read(T& x) {
        char c = gc(), l = 0; x = 0;
        while (!isdigit(c)) l = c, c = gc();
        while ( isdigit(c)) x = (x << 1) + (x << 3) + c - 48, c = gc();
        if (l == '-') x = -x;
    }
    template <typename T, typename ...A> void read(T& x, A&... a) {
        read(x), read(a...);
    }
} IO;
const int N = 100;
int n;
char op[N]; int dis[N];
char dir[100];
vector <pair <int, int> > res;
void solve() {
    res.clear();
    IO.read(n);
    dir['N'] = 0, dir['W'] = 1, dir['S'] = 2, dir['E'] = 3;
    int st, now;
    for (int i = 1; i <= n; i++) {
        cin >> op[i] >> dis[i];
        if (i == 1) st = now = dir[op[i]];
    } res.emplace_back(0, dis[1]);
    for (int i = 2; i <= n; i++) {
        int del = (dir[op[i]] - now + 4) % 4;
        if (del == 0) {
            res.back().second += dis[i];
            continue;
        }
        if (del == 1) {
            res.emplace_back(1, 0);
            res.emplace_back(0, dis[i]);
        } else if(del == 3) {
            res.emplace_back(2, 0);
            res.emplace_back(0, dis[i]);
        } now = dir[op[i]];

    } printf("%d %c\n", (int)res.size(), op[1]);
    for (auto [op, len] : res) {
        if (op == 0) printf("Z %d\n", len);
        else if (op == 1) printf("L\n");
        else printf("R\n");
    }
}
int main() {
    int T; IO.read(T);
    while (T--) {solve();}
    return 0;
}