#include <bits/stdc++.h>

using namespace std;

using i64 = long long;
using i128 = __int128;
using ull = unsigned long long;
#define pll pair<ll, ll>
#define pii pair<int, int>
#define vi vector<int>
#define fir(i, a, b) for (int i = a; i <= b; i++)
#define pqi priority_queue<int> // 优先队列

#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long

string dir = "NESW";
void solve()
{
    int n;
    std::cin >> n;
    std::string ch;
    std::vector<int> len(n + 1);
    for (int i = 1; i <= n; i++)
    {
        std::cin >> ch[i] >> len[i];
    }
    std::cout << 2 * n - 1 << " " << ch[1] << "\n";

    for (int i = 1; i <= n; i++)
    {
        cout << "Z" << " " << len[i] << "\n";
        if (i == n)
            break;
        int a = 0;
        for (int j = 0; j < 4; j++)
        {
            if (ch[i] == dir[j])
            {
                a = j;
            }
        }
        if (ch[i + 1] == dir[(a + 1) % 4])
            cout << "R\n";
        else
            cout << "L\n";
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t;
    std::cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}