#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define mp make_pair
#define endl '\n'
#define dbug() cout << '||||||debug|||||' << endl;
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
const int N = 1e5+10;
const int mod = 1e9+7;
const int INF = 1e18;
void solve()
{
    int n, m, k;
    cin >> n;
    queue<pair<char, int>> q;
    char s;
    int x;
    for (int i = 0; i < n; ++i){
        cin >> s >> x;
        q.push({s, x});
    }
    int falg = 0;
    cout << 2*n-1 << ' ';
    char pre='#';
    while (!q.empty()){
        pair<char, int> p = q.front();
        if (pre == '#'){
            cout << p.first << endl;
            pre = p.first;
            cout << 'Z' << ' ' << p.second << endl;
            q.pop();
            continue;
        }
        if (pre=='S'){
            if (p.first=='E') cout << 'L' << endl, pre = 'E';
            else cout << 'R' << endl, pre = 'W';
        }
        else if (pre=='N'){
            if (p.first == 'E') cout << 'R' << endl, pre = 'E';
            else cout << 'L' << endl, pre = 'W';
        }
        else if (pre=='E'){
            if (p.first == 'N') cout << 'L' << endl, pre = 'N';
            else cout << 'R' << endl, pre = 'S';
        }
        else if (pre=='W'){
            if (p.first == 'S') cout << 'L' << endl, pre = 'S';
            else cout << 'R' << endl, pre = 'N';
        }
        // cout << pre << endl;
        cout << 'Z' << ' ' << p.second << endl;
        q.pop();
    }
    
    
}

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