#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<ll, ll> pii;

int n, mp[128];
struct node {
	char x;
	int y;
} a[99];

void solve() {
	cin >> n;
	mp['N'] = 0;
	mp['E'] = 1;
	mp['S'] = 2;
	mp['W'] = 3;
	for (int i = 1; i <= n; ++i) {
		cin >> a[i].x >> a[i].y;
	}
	vector< pair<char, int> > ans;
	int d = mp[a[1].x];
	for (int i = 1; i <= n; ++i) {
		int x = mp[a[i].x];
		if (d != x) {
			if ((d + 1) % 4 == x) {
				ans.pb('R', 0);
			} else {
				ans.pb('L', 0);
			}
		}
		d = x;
		ans.pb('Z', a[i].y);
	}
	printf("%d %c\n", (int)ans.size(), a[1].x);
	for (pair<char, int> p : ans) {
		if (p.fst == 'Z') {
			printf("Z %d\n", p.scd);
		} else {
			printf("%c\n", p.fst);
		}
	}
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}