#include<bits/stdc++.h>

#define ll long long 
#define pb push_back
#define ff first
#define ss second
#define ld long double

using namespace std;

int get_val(char x){
    if( x == 'N') return 0;
    if( x == 'E') return 1;
    if( x == 'S') return 2;
    return 3;
}

void Test(){
    int n;
    cin >> n;
    vector<pair<int,int>> a(n);
    int ok = 0;
    char start = '#';
    for(int i = 0; i < n; ++i){
        char s;
        int add;
        cin >> s >> add;
        a[i].first = get_val(s);
        a[i].second = add;
        if(!ok){
            ok = 1;
            start = s;
        }
    }
    int dir = -1;
    vector<pair<char,int>> ans;
    for(int i = 0; i < n; ++i){
        if( dir ==  -1 ){
            ans.push_back({'Z',a[i].second});
            dir = a[i].first;
        }else{
            if( dir == 0 ){
                char val = (a[i].ff == 3 ? 'L' : 'R');
                ans.push_back({val,-1});
                ans.push_back({'Z',a[i].second});
            }
            if( dir == 1 ){
                char val = (a[i].ff == 0 ? 'L' : 'R');
                ans.push_back({val,-1});
                ans.push_back({'Z',a[i].second});
            }
            if( dir == 2 ){
                char val = (a[i].ff == 1 ? 'L' : 'R');
                ans.push_back({val,-1});
                ans.push_back({'Z',a[i].second});
            }
            if( dir == 3 ){
                char val = (a[i].ff == 2 ? 'L' : 'R');
                ans.push_back({val,-1});
                ans.push_back({'Z',a[i].second});
            }
            dir = a[i].first;
        }
    }
    cout << ans.size() << ' ' << start << '\n';
    for(auto& e : ans){
        char val = e.first;
        int dis = e.second;
        if( dis == -1 ) cout << val << '\n';
        else cout << val << ' ' << dis << '\n';
    }
}


int main(){
    #ifdef LOCAL
    freopen("in.txt", "r", stdin);
    #endif
    ios::sync_with_stdio(NULL);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while(T--){
        Test();
    }
    return 0;
}