#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100010;
const char dir[4] = {'N', 'E', 'S', 'W'};
int n;
vector<pair<char, int> > a;
int cnt;

int Get(char c) {
    for(int i = 0; i < 4; i++)
        if(dir[i] == c)
            return i;
    return -1;
}
void solve() {
    cin >> n;
    a.clear();
    for(int i = 1; i <= n; i++) {
        char x; int y;
        for(cin >> x; x < 'A' || x > 'Z'; cin >> x);
        cin >> y;
        a.push_back({x, y});
    }
    cout << 2 * n - 1 << " " << a[0].first << "\n";
    int cur = Get(a[0].first);
    cout << "Z " << a[0].second << "\n";
    for(int i = 1; i < n; i++) {
        int nxt = Get(a[i].first);
        if((nxt - cur + 4) % 4 == 1) {
            cout << "R\n";
        }
        else cout << "L\n";
        cout << "Z " << a[i].second << "\n";
        cur = nxt;
    }
}
int main() {
    ios::sync_with_stdio(0); cin.tie(nullptr);
    int T; cin >> T;
    for(; T; --T) solve();
    return 0;
}