#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

template <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {
    for (auto& e : v) {
        is >> e;
    }
    return is;
}

template <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {
    for (std::string_view sep = ""; const auto& e : v) {
        os << std::exchange(sep, " ") << e;
    }
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) {
    return y < x and (x = std::forward<U>(y), true);
}

template <class T, class U = T> bool chmax(T& x, U&& y) {
    return x < y and (x = std::forward<U>(y), true);
}

template <class T> void mkuni(std::vector<T>& v) {
    std::ranges::sort(v);
    auto result = std::ranges::unique(v);
    v.erase(result.begin(), result.end());
}

template <class T> int lwb(const std::vector<T>& v, const T& x) {
    return std::distance(v.begin(), std::ranges::lower_bound(v, x));
}

using namespace std;

using ll = long long;

int ctoi(char c) {
    if (c == 'E') return 0;
    if (c == 'N') return 1;
    if (c == 'W') return 2;
    return 3;
}

void solve() {
    int n;
    cin >> n;

    cout << 2 * n - 1 << " ";
    for (int i = 0, pre = -1; i < n; i++) {
        char d;
        int x;
        cin >> d >> x;
        int nxt = ctoi(d);
        if (pre == -1) {
            cout << d << "\n";
            cout << "Z " << x << "\n";
        } else {
            if (nxt == (pre + 3) % 4) {
                cout << "R\n";
            } else if (nxt == (pre + 1) % 4) {
                cout << "L\n";
            } else {
                assert(false);
            }
            cout << "Z " << x << "\n";
        }
        pre = nxt;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    int T;
    cin >> T;
    for (; T--;) solve();
    return 0;
}