#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
#define endl '\n'
#define sz(x) (int)(x).size()
#define all(t) (t).begin(), (t).end()
#define rep(i, a, b) for (ll i = (a); i <= (b); ++i)
#define per(i, a, b) for(ll i = (a); i >= (b); --i)

map<pair<char, char>, string>mp;

struct step{
	char c;
	int x;
};

void solve() 
{
	mp[{'N', 'E'}] = "R";
	mp[{'N', 'S'}] = "RR";
	mp[{'N', 'W'}] = "L";

	mp[{'E', 'S'}] = "R";
	mp[{'E', 'W'}] = "RR";
	mp[{'E', 'N'}] = "L";

	mp[{'S', 'W'}] = "R";
	mp[{'S', 'N'}] = "RR";
	mp[{'S', 'E'}] = "L";

	mp[{'W', 'N'}] = "R";
	mp[{'W', 'E'}] = "RR";
	mp[{'W', 'S'}] = "L";
	ll n;
	cin >> n;
	step a[n + 5];
	rep(i, 1, n) {
		cin >> a[i].c >> a[i].x;
	}
	char k = a[1].c;
	char cur = k;
	vector<pair<char, int> >ans;
	rep(i, 1, n) {
		if(cur == a[i].c) {
			ans.push_back({'Z', a[i].x});
		}
		else {
			string s = "";
			for(int j = 0; j <= (int)mp[{cur, a[i].c}].size() - 1; j++) {
				ans.push_back({mp[{cur, a[i].c}][j], 0});
			}
			ans.push_back({'Z', a[i].x});
			cur = a[i].c;
		}
	}
	cout << ans.size() << ' ' << k << endl;
	for(auto [x, y] : ans) {
		cout << x << ' ';
		if(y) cout << y;
		cout << endl;
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T = 1;
	cin >> T;
	//	cout.flush();
	//		ofstream outfile("C:\\Users\\86187\\OneDrive\\桌面\\1.txt");
	//		outfile << "a[1]=0;a[2]=1;";
	//		ll l = 1e7 + 1;
	//		rep(i, 3, 1e9) {
	//			printf("%lld\n", i);
	//			ll x = (i - 1) * ((a[i - 1] + a[i - 2]) % mod);
	//			x %= mod;
	//			if(i == l) {
	//				outfile << "a[" << i << "]=" << x << ";";
	//			}
	//			if(i == l + 1) {
	//				outfile << "a[" << i << "]=" << x << ";";
	//				l += 1e7;
	//			}
	//		}
	while(T--) {
		solve();
	}
	return 0;
}