#include <bits/stdc++.h>

using i64 = long long;

void solve() {
	int n;
	std::cin >> n;

	std::vector<std::pair<char, int>> a(n);
	for (int i = 0; i < n; i++) {
		char d;
		int x;
		std::cin >> d >> x;
		a[i] = {d, x};
	}

	std::map<char, int> map;
	map['N'] = 0;
	map['E'] = 1;
	map['S'] = 2;
	map['W'] = 3;

	std::vector<std::pair<char, int>> ans;
	int cur = 0;
	char last = a[cur].first;
	while (cur < n) {
		auto [d, x] = a[cur];
		if (last == d) {
			ans.emplace_back(std::make_pair('Z', x));
			cur++;
		} else {
			if (map[d] - map[last] == 1 || last == 'W' && d == 'N') {
				ans.emplace_back(std::make_pair('R', -1));
			} else {
				ans.emplace_back(std::make_pair('L', -1));
			}
			last = d;
		}
	}

	std::cout << ans.size() << " " << a[0].first << "\n";
	for (auto [d, x] : ans) {
		std::cout << d;
		if (x != -1) {
			std::cout << " " << x << "\n";
		} else {
			std::cout << "\n";
		}
	}
}

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

	int t;
	std::cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}