#include<bits/stdc++.h>

using namespace std;

#define pll pair<ll, ll>
#define ll long long
const int mod = 1e9 + 7;
const int N = 3e5 + 50;

char d[20];
ll x[20];
vector<pair<char, ll> > ans;

void solve()
{
    ll n;
    char c;
    cin >> n;
    for (int i = 1; i <= n; i++) cin >> d[i] >> x[i];
    c = d[1];
    ans.push_back({'Z', x[1]});
    for (int i = 2; i <= n; i++)
    {
        if (c == 'N')
        {
            if (d[i] == 'W') ans.push_back({'L', 0});
            else ans.push_back({'R', 0});
        }

        if (c == 'S')
        {
            if (d[i] == 'W') ans.push_back({'R', 0});
            else ans.push_back({'L', 0});
        }

        if (c == 'W')
        {
            if (d[i] == 'N') ans.push_back({'R', 0});
            else ans.push_back({'L', 0});
        }

        if (c == 'E')
        {
            if (d[i] == 'N') ans.push_back({'L', 0});
            else ans.push_back({'R', 0});
        }
        c = d[i];
        ans.push_back({'Z', x[i]});
    }
    cout << ans.size() << ' ' << d[1] << '\n';
    for (auto [p, q] : ans)
    {
        if (q == 0) cout << p << '\n';
        else cout << p << ' ' << q << '\n';
    }
    ans.clear();
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll T = 1;
    cin >> T;
    while (T --)
    {
        solve();
    }
    
    return 0;
}