#include<bits/stdc++.h>
#define rep(i, l, r) for(int i = (l); i <= (r); i ++)
#define pre(i, l, r) for(int i = (l); i >= (r); i --)
#define Grp(x, i) for(int i = h[x]; i; i = ne[i])
using namespace std;

typedef long long LL;
const int N = 200009;

inline int read() {
    int x = 0; char fs = 0, c = getchar(); while(! isdigit(c)) fs |= (c == '-'), c = getchar();
    while(isdigit(c)) x = (x << 1) + (x << 3) + (c - '0'), c = getchar();
    return fs ? -x : x;
}


int T, n;
char ans[N];
int tot;
int len[N];
char fs[209][209];
int pos[4];

int main() {
    pos[0] = 'N';
    pos[1] = 'W';
    pos[2] = 'S';
    pos[3] = 'E';
    for(int i = 0; i <= 3; i ++) {
        fs[pos[i]][pos[(i + 1) % 4]] = 'L';
        fs[pos[i]][pos[(i + 3) % 4]] = 'R';
    }
    T = read();
    while(T --) {
        tot = 0;
        n = read();
        char now;
        ans[0] = 0;
        for(int i = 1; i <= n; i ++) {
            char op[3]; int l;
            scanf("%s%d", op, &l);
            if(! ans[0]) ans[0] = op[0];
            if(i == 1) ans[++ tot] = 'Z', len[tot] = l;
            else {
                ans[++ tot] = fs[(int)now][(int)op[0]];
                ans[++ tot] = 'Z';
                len[tot] = l;
            }
            now = op[0];
        }
        printf("%d %c\n", tot, ans[0]);
        rep(i, 1, tot) {
            printf("%c", ans[i]);
            if(ans[i] == 'Z') printf(" %d\n", len[i]);
            else printf("\n");
        }
    }
    return 0;
}