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

typedef long long ll;

char dir[] = {'S', 'E', 'N', 'W'};
map<char, int> mp;

void solve()
{
    int n;
    cin >> n;
    vector<pair<char, int>> target(n + 1);
    for (int i = 1; i <= n; i++)
    {
        char c;
        cin >> c;
        int x;
        cin >> x;
        target[i] = {c, x};
    }
    vector<pair<char, int>> ans;
    for (int i = 1; i <= n; i++)
    {
        if (i == 1)
            ans.push_back({'Z', target[i].second});
        else
        {
            int start = mp[target[i - 1].first];
            int step1 = 0;
            while (dir[start] != target[i].first)
            {
                start = (start + 1) % 4;
                step1++;
            }

            start = mp[target[i - 1].first];
            int step2 = 0;
            while (dir[start] != target[i].first)
            {
                start = (start - 1 + 4) % 4;
                step2++;
            }
            
            if (step1 <= step2)
            {
                while (step1--)
                {
                    ans.push_back({'L', 0});
                }
            }
            else
            {
                while (step2--)
                {
                    ans.push_back({'R', 0});
                }
            }

            ans.push_back({'Z', target[i].second});
        }
    }

    cout << ans.size() << " ";
    cout << target[1].first << "\n";
    for (auto [x, y] : ans)
    {
        cout << x << " ";
        if (y != 0)
            cout << y << " ";
        cout << "\n";
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    mp['S'] = 0;
    mp['E'] = 1;
    mp['N'] = 2;
    mp['W'] = 3;

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

    return 0;
}