#include<bits/stdc++.h>
using namespace std;
#define int long long
#define lowbit(x) (x & (-x))
#define lc p << 1
#define rc p << 1 | 1
typedef long long ll;
typedef pair<int,int> pii;
mt19937 rnd(time(0));
const int N = 3e5 + 7;
const int mod = 1e9 + 7;
pair<char,int> a[N];
void solve() {
	int n; cin >> n;
    for(int i = 1;i <= n;i++) cin >> a[i].first >> a[i].second;
    char c = a[1].first;
    int t = (n - 1) + n;
    cout << t << " " << c << "\n";
    for(int i = 1;i <= 2 * n - 1;i++) {
        if(i & 1) cout << "Z " << a[(i + 1) / 2].second << "\n";
        else {
            if(a[(i + 2) / 2].first == 'S') {
                if(a[i / 2].first == 'E') cout << "R\n";
                else cout << "L\n";
            }
            else if(a[(i + 2) / 2].first == 'E') {
                if(a[i / 2].first == 'N') cout << "R\n";
                else cout << "L\n";
            }
            else if(a[(i + 2) / 2].first == 'N') {
                if(a[i / 2].first == 'W') cout << "R\n";
                else cout << "L\n";
            }
            else if(a[(i + 2) / 2].first == 'W') {
                if(a[i / 2].first == 'S') cout << "R\n";
                else cout << "L\n";
            }
        }
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}