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

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

map<char, int> f;

inline void work() {
    int n = rd();
    vector<pair<char, int>> steps;
    char first_dir = 0, dir = 0;
    rep(i, 1, n) {
        char c = getchar();
        while (!isalpha(c)) c = getchar();
        if (first_dir == 0) {first_dir = dir = c;}
        else {
            if (dir != c) {
                if ((f[dir] + 1) % 4 == f[c]) steps.eb('L', 0);
                else steps.eb('R', 0);
                dir = c;
            }
        }
        steps.eb('Z', rd());
    }
    printf("%d %c\n", (int)steps.size(), first_dir);
    for (auto [ch, dis] : steps) {
        printf("%c", ch);
        if (dis) printf(" %d", dis);
        puts("");
    }
}

int main() {
    f['N'] = 0;
    f['W'] = 1;
    f['S'] = 2;
    f['E'] = 3;
    per(t, rd(), 1) work();
    return 0;
}