#include <bits/stdc++.h>
using namespace std;
using ui = unsigned int;
using ull = unsigned long long;
using ll = long long;
#define endl '\n'
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int maxn = 2e5 + 10;
const int mod = 1000000007;
#define inl inline
#define fr(i, a, b) for (int i = a; i <= b; i++)
#define ford(i, a, b) for (int i = a; i >= b; i--)
#define forall(i, a) for (auto &i : a)

/**
   ____         ___ _____
  / ___| _   _ / _ \___ /
  \___ \| | | | | | ||_ \
   ___) | |_| | |_| |__) |
  |____/ \__, |\___/____/
         |___/
*/
istream &operator>>(istream &in, vector<int> &v)
{
    for (auto &i : v)
        in >> i;
    return in;
}
ostream &operator<<(ostream &out, vector<int> &v)
{
    for (auto &i : v)
        out << i << " ";
    return out;
}
bool _output = 1;

void solve()
{
    int n;
    cin >> n;
    vector<pair<char, int>> a(n);
    for (int i = 0; i < n; i++)
        cin >> a[i].first >> a[i].second;
    vector<pair<char, int>> ans;
    map<char, map<char, char>> mp;
    mp['S']['E'] = 'L';
    mp['S']['W'] = 'R';
    mp['N']['W'] = 'L';
    mp['N']['E'] = 'R';
    mp['E']['N'] = 'L';
    mp['E']['S'] = 'R';
    mp['W']['S'] = 'L';
    mp['W']['N'] = 'R';
    char now = a[0].first;
    ans.push_back({'Z', a[0].second});
    for (int i = 1; i < n; i++)
    {
        auto p = mp[now][a[i].first];
        ans.push_back({p, -1});
        now = a[i].first;
        ans.push_back({'Z', a[i].second});
    }
    cout << ans.size() << " " << a[0].first << endl;
    for (auto [c, x] : ans)
    {
        if (x == -1)
        {
            cout << c << endl;
        }
        else
        {
            cout << c << " " << x << endl;
        }
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    if (_output)
        cin >> _;
    while (_--)
        solve();
    return 0;
}