#include <bits/stdc++.h>

#define ll long long

using namespace std;

vector<string> dir = {"N", "E", "S", "W"};


void solve(){
	int n;
	cin >> n;
	vector<pair<string,int>> op(n);
	for(auto &[d, x] : op)
		cin >> d >> x;

	vector<string> res;
	string staD = op[0].first;

	int t = 0;
	while(dir[t] != staD) t ++;

	for(auto [d, x] : op) {
		if(dir[t] != d) {
			int t1 = (t + 1) % 4; 
			int t2 = (t + 3) % 4;
			if(dir[t1] == d) res.push_back("R"), t = t1;
			else if(dir[t2] == d) res.push_back("L"), t = t2;
		}
		res.push_back("Z " + to_string(x));
	}
	cout << res.size() << " " << staD << "\n";
	for(auto i : res)
		cout << i << "\n";
	return;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);

	int T;
	cin >> T;

	while(T --)
		solve();

	return 0;
}