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

struct node
{
    char c;
    int x;
};

map<pair<char, char>, char> pd;

void solve()
{
    int n;
    cin >> n;
    vector<node> v;

    char chu = ' ';
    char fx, upfx;
    for (int i = 0; i < n; i ++)
    {
        char c;
        int x;
        cin >> c >> x;
        if (chu == ' ') 
        {
            chu = c;
            fx = c;
            v.push_back({'Z', x});
        }
        else 
        {
            // cout << upfx << ' ' << c << "!!\n";
            v.push_back({pd[{upfx, c}], 0});
            v.push_back({'Z', x});
        }
        upfx = c;
    }
    cout << v.size() << " " << fx << "\n";
    for (auto it : v)
    {
        cout << it.c;
        if (it.c == 'Z') cout << " " << it.x;
        cout << "\n";
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    pd[{'N', 'E'}] = 'R';
    pd[{'N', 'W'}] = 'L';

    pd[{'S', 'E'}] = 'L';
    pd[{'S', 'W'}] = 'R';

    pd[{'E', 'S'}] = 'R';
    pd[{'E', 'N'}] = 'L';

    pd[{'W', 'S'}] = 'L';
    pd[{'W', 'N'}] = 'R';

    int T = 1;
    cin >> T;
    while (T --)
       solve();

}