#include <iostream>
#include <map>
#include <vector>
using namespace std;

void solve() {
    int n;
    cin >> n;
    map<char,int> mp;
    mp['S'] = 1, mp['E'] = 2, mp['N']=3, mp['W']=0;
    vector<char> ans1;
    vector<int> ans2;
    char first_to;
    char to = 'a';
    for (int i=1;i<=n;i++) {
        char x;
        int p;
        cin >> x >> p;
        if (to == 'a') to = x, first_to = x;
        if (x == to) {
            ans1.push_back('Z');
            ans2.push_back(p);
        }
        else {
            if(mp[x] - mp[to] == 1 || mp[x] - mp[to] == -3) {
                ans1.push_back('L');
                ans2.push_back(0);
                ans1.push_back('Z');
                ans2.push_back(p);
            }
            else {
                ans1.push_back('R');
                ans2.push_back(0);
                ans1.push_back('Z');
                ans2.push_back(p);
            }
        }
        to = x;
    }
    cout << ans1.size() <<' '<<first_to << endl;
    for (int i = 0; i < ans1.size();i++) {
        cout << ans1[i] << " ";
        if(ans2[i]) cout << ans2[i];
        cout << endl;
    }
}

int main() {
    int t;
    cin >> t;
    while(t--) solve();
    return 0;
}