#include<bits/stdc++.h>

using namespace std;
using LL = long long;

const int N = 1111;
const int mod = 1000000007;
const int INF = 0x3f3f3f3f3f3f3f3f;
const double ef = 1e-12;
const double PI = acos(-1);

#define rep(i,a, b) for(int i = a;i<=b;i++)
#define pre(i,a, b) for(int i = a;i>=b;i--)

struct Point {
	LL x, y;
	bool operator< (const Point& a)const {
		if (a.x == x) {
			return y < a.y;
		}
		return x < a.x;
	}
};

struct Vector {
	LL x, y;
	Vector(LL x = 0, LL y = 0) : x(x), y(y) {}
	bool operator < (Vector& a) {
		if (x == a.x)return y < a.y;
		return x < a.x;
	}
};

LL Cross(Vector a, Vector b) {
	return a.x * b.y - a.y * b.x;
};

LL Cross(Point a, Point b, Point c) {

	LL x1 = b.x - a.x; LL y1 = b.y - a.y;
	LL x2 = c.x - a.x; LL y2 = c.y - a.y;
	return x1 * y2 - x2 * y1;
}

void solve() {

	int n;
	cin >> n;

	char chu = '0';

	vector<pair<char, int>> a(n+1);
	
	rep(i, 1, n) {
		cin >> a[i].first >> a[i].second;
	}

	chu = a[1].first;
	int cnt = 1 + 2 * (n - 1);

	cout << cnt << " " << chu << "\n";
//	cout << "Z " << a[1].second << "\n";
	rep(i, 1, n) {
	
		cout << "Z " << a[i].second<<"\n";
	
		if (i == n)break;

		if (a[i].first == 'N') {

			if (a[i+ 1].first == 'W') {
				cout << "L\n";
			}
			if (a[ i+1 ].first == 'E') {
				cout << "R\n";
			}

		}
		if (a[i].first == 'S') {
	
			if (a[i + 1].first == 'W') {
				cout << "R\n";
			}
			if (a[i+1].first == 'E') {
				cout << "L\n";
			}
		}
		if (a[i].first == 'W') {
			if (a[i + 1].first == 'N') {
				cout << "R\n";
			}
			if (a[i + 1].first == 'S') {
				cout << "L\n";
			}
		
		}
		if (a[i].first == 'E') {
			if (a[i + 1].first == 'N') {
				cout << "L\n";
			}
			if (a[i + 1].first == 'S') {
				cout << "R\n";
			}
		}
	}

	cout << '\n';
}

int main() {

	ios::sync_with_stdio(false);
	cin.tie(nullptr);


	int t = 1;
	cin >> t;

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

	return 0;

}