#include<bits/stdc++.h>

#define ll long long
#define alls(x) x.begin(),x.end()
#define ull unsigned long long
#define lowbit(x) x&-x
#define lc p<<1
#define rc p<<1|1
#define PII pair<int,int>
#define vi vector<int>
//#define int long long

using namespace std;
const ll inf = 2e18;
const int mod = 998244353;
const int N = 1e6 + 10;
map<pair<char, char>, char> mp =
        {
                {{'S', 'E'}, 'L'},
                {{'E', 'N'}, 'L'},
                {{'N', 'W'}, 'L'},
                {{'W', 'S'}, 'L'},
                {{'E', 'S'}, 'R'},
                {{'S', 'W'}, 'R'},
                {{'W', 'N'}, 'R'},
                {{'N', 'E'}, 'R'}
        };

void solve() {
    int n;
    cin >> n;
    vector<pair<char, int>> a(n);
    for (auto &[x, y]: a)cin >> x >> y;
    char t = a[0].first;
    cout << 2 * n - 1 << " " << t << '\n';
    cout << "Z" << " " << a[0].second << '\n';
    for (int i = 1; i < n; i++) {
        char now = a[i].first, pre = a[i - 1].first;
        cout << mp[{pre, now}] << '\n';
        cout << 'Z' << " " << a[i].second << "\n";
    }
}

signed main() {
    cout << fixed << setprecision(6);
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    int _ = 1;
    cin >> _;
    while (_--)solve();
}