#include<bits/stdc++.h>
#include<iomanip>
#define int long long
#define endl '\n'
#define mset multiset
#define PII pair<int,int>
#define lid id<<1
#define rid id<<1|1
#define x first
#define y second
#define ld long double
#define lb(x) ((x)&(-x))
#define pb(x) push_back(x)
using namespace std;
using ll =long long;
const int N=1e5+10;
struct node{
	int a;
	int x;
}ar[N];
char de[]={'a','N','E','S','W'};
void solve() {
	int n;
	cin>>n;
	for(int i=1; i<=n; ++i) {
		char a;cin>>a;
		if(a=='N')ar[i].a=1;
		else if(a=='E')ar[i].a=2;
		else if(a=='S')ar[i].a=3;
		else ar[i].a=4;
		cin>>ar[i].x;
	}
	cout<<2*n-1<<' '<<de[ar[1].a]<<endl;
	cout<<"Z"<<' '<<ar[1].x<<endl;
	for(int i=2;i<=n;++i){
		if(ar[i].a==1&&ar[i-1].a==4)cout<<"R"<<endl;
		else if(ar[i].a==4&&ar[i-1].a==1)cout<<"L"<<endl;
		else if(ar[i].a>ar[i-1].a)cout<<"R"<<endl;
		else cout<<"L"<<endl;
		cout<<"Z"<<' '<<ar[i].x<<endl;
	}
}
signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin>>T;
	while(T--)
		solve();
}