#include <bits/stdc++.h>
//#define int long long
#define endl "\n"
#define pi acos(-1)
#define ll long long
#define lowbit(x) ((x) & -(x))
#define ALL(v) v.begin(), v.end()
#define out(x) cerr << "|-> " << #x << " = " << (x) << " <-|" << endl
#define out2(x, y) cerr << "|-> " << #x << " = " << (x) << ", " << #y << " = " << (y) << " <-|" << endl 

using namespace std;

typedef vector<int> vi;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

const int N = 1e5 + 10;
const double eps = 1e-6;
const int mod = 998244353;
const int MOD = 1000000007;
const ll inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;

//char tur[4]={'N', 'E', 'S', 'W'};
map<char,int> mp;

void solve() {
	int n;
	cin>>n;
	
	int cnt=0;
	vector<string> ans;
	char ft=100;
	for(int i=0;i<n;i++)
	{
		char c;
		string d;
		cin>>c>>d;
		if(i==0)
		{
			string t1, t2;
			t1+=c;
			t2="Z ";
			t2+=d;
			ans.push_back(t1);
			ans.push_back(t2);
			ft=mp[c];
			cnt+=2;
		}
		else
		{
			char nt=mp[c];
			if((nt-ft+4)%4==1)
			{
				string t1, t2;
				t1="R";
				t2="Z ";
				t2+=d;
				ans.push_back(t1);
				ans.push_back(t2);
				cnt+=2;
			}
			else //if((nt-ft+4)%4==3)
			{
				string t1, t2;
				t1="L";
				t2="Z ";
				t2+=d;
				ans.push_back(t1);
				ans.push_back(t2);
				cnt+=2;
			}
			//else
			//{
			//	string t1, t2, t3;
			//	t1="R";
			//	t2="R";
			//	ans.push_back(t1);
			//	ans.push_back(t2);
			//	t3="Z ";
			//	t3+=d;
			//	ans.push_back(t3);
			//	cnt+=3;
			//}
			ft=nt;
		}
	}
	
	cout<<cnt-1<<' ';
	for(int i=0;i<cnt;i++)
	{
		cout<<ans[i]<<endl;
	}
}

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	
	int t = 1;
	cin >> t;
	
	mp['N']=0;
	mp['E']=1;
	mp['S']=2;
	mp['W']=3;
	
	while (t--) {
		solve();
	}
	
	return 0;
}