#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
void solve() {
    int n;
    cin >> n;
    vector<pair<char,int>>a(n + 1);
    for(int i = 1;i <= n;i++) cin >> a[i].first >> a[i].second;
    char fir = a[1].first;
    vector<pair<char,int>>ans;
    int cnt = 2 * n - 1;
    for(int i = 2;i <= n;i++){
        ans.push_back({'Z',a[i - 1].second});
        if(a[i - 1].first == 'S'){
            if(a[i].first == 'E') ans.push_back({'L',-1});
            else ans.push_back({'R',-1});
        }
        else if(a[i - 1].first == 'E'){
            if(a[i].first == 'S') ans.push_back({'R',-1});
            else ans.push_back({'L',-1});
        }
        else if(a[i - 1].first == 'W'){
            if(a[i].first == 'S') ans.push_back({'L',-1});
            else ans.push_back({'R',-1});
        }
        else {
            if(a[i].first == 'E') ans.push_back({'R',-1});
            else ans.push_back({'L',-1});
        }

    }
    ans.push_back({'Z',a[n].second});
    cout << cnt << ' ' << fir << endl;
    for(auto [c,v] : ans){
        if(v == -1) cout << c << endl;
        else cout << c << ' ' << v << endl;
    }
}
/*
1
2
S 2
E 1
*/
signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);

    int T = 1;
    cin >> T;
    while (T--) {
        solve();
    }

    return 0;
}