#ifdef local
#pragma GCC optimize(1)
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#endif
// #pragma comment(linker, "/STACK:102400000,102400000")

#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#ifndef local
#define endl '\n'
#endif

#define pb emplace_back
#define fi first
#define se second
#define rep(i, l, r) for (long long i = l; i <= r; i++)
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define mem(a, x) memset(a, x, sizeof(a))
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
typedef pair<ll, ll> P;
typedef pair<P, ll> PP;
const double pi = acos(-1);
typedef __int128_t int128;
const db eps = 1e-9;
std::mt19937_64 rng(time(0));
ll my_random(ll l, ll r)
{

	uniform_int_distribution<int> range(l, r);
	return range(rng);
}
void __()
{
#ifdef local
	system("pause");
#endif
}
ll qp(ll a, ll b, ll mod)
{
	ll ans = 1;
	while (b)
	{
		if (b & 1)
			ans = ans * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return ans;
}

char c[15];
int s[15];
char d[] = {'N', 'E', 'S', 'W'};
char get(char s, char e)
{
	for (int i = 0; i < 4; i++)
	{
		if (d[i] == s && d[(i + 1) % 4] == e)
			return 'R';
	}
	return 'L';
}
int main()
{
	IOS;
	int t;
	cin >> t;
	while (t--)
	{
		int n;
		cin >> n;
		char lst;
		for (int i = 1; i <= n; i++)
		{
			cin >> c[i] >> s[i];
			if (i == 1)
			{
				cout << 2 * n - 1 << ' ' << c[1] << endl;
			}
			if(i!=1)
			{
				cout << get(lst, c[i]) << endl;
			}
			cout << "Z " << s[i] << endl;
			lst = c[i];
		}
		cout << endl;
	}

	__();

	return 0;
}