#include<bits/stdc++.h>
using namespace std;
#define int long long
struct node {
	char x, y;
};
void solve() {
	int n;
	cin >> n;
	vector<node> a(n + 1);
	for(int i = 1; i <= n; i++) {
		cin >> a[i].x >> a[i].y;
		// cout << a[i].x << " " << a[i].y << endl;
	}
	char c = a[1].x;
	auto b = c;
	map<char, int>mp;
	mp['N'] = 1;mp['S'] = 3;
	mp['W'] = 4;mp['E'] = 2;
	vector<pair<char, char>> ans;
	ans.push_back({'Z', a[1].y});
	// cout << a[1].y << endl;
	for(int i = 2; i <= n; i++) {
		if(mp[a[i].x] > mp[c]) {
			int t = mp[a[i].x] - mp[c];
			if(t == 1) {
				ans.push_back({'R', ' '});
			}
			else ans.push_back({'L', ' '});
		}
		else if(mp[a[i].x] < mp[c]) {
			int t = mp[a[i].x] - mp[c];
			t = -t;
			if(t == 1) {
				ans.push_back({'L', ' '});
			}
			else ans.push_back({'R', ' '});
		}
		ans.push_back({'Z', a[i].y});
		c = a[i].x;
	}
	cout << ans.size() << " " << b << endl;
	for(auto [x, y]: ans) {
		cout << x << " " << y << endl;
	}
}

#undef int
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}