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

char a[] = {'E', 'S', 'W', 'N'};
void solve()
{
    int n;
    cin >> n;
    char dir = 0;
    list<pair<char, int>> res;

    unordered_map<char, int> mp;
    mp.insert({'E', 0});
    mp.insert({'S', 1});
    mp.insert({'W', 2});
    mp.insert({'N', 3});

    for (int i = 1; i <= n; i++)
    {
        char ch;
        int x;
        cin >> ch >> x;

        if (dir == 0)
        {
            res.push_back({ch, x});
            dir = ch;
        }
        else
        {
            if (a[(mp[ch] + 1 + 4) % 4] == ch)
            {
                res.push_back({'R', x});
            }
            else
            {
                res.push_back({'L', x});
            }
        }
    }

    cout << 2 * res.size() - 1 << ' ';

    for (auto [dir, x] : res)
    {
        cout << dir << '\n';
        cout << "Z " << x << '\n';
    }
}

signed main()
{
    cin.tie(0)->ios::sync_with_stdio(false);

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

    return 0;
}