#include <bits/stdc++.h>

#define int long long
#define fadd(a,b,c) for (int a=b;a<=c;a++)
#define fsub(a,b,c) for (int a=b;a>=c;a--)
#define F first
#define S second
#define CYes cout << "Yes\n"
#define CNo cout << "No\n"
#define CYES cout << "YES\n"
#define CNO cout << "NO\n"
#define println(a) cout << (a) << '\n'

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
void fastIO(){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
class bhscer {
public:
    template<typename FIRST, typename ...PACK> static void debug(FIRST first, PACK... params) { std::cout<< first <<' '; debug(params...);}
    template<typename T> static void debug(T end) { std::cout << end << std::endl; }
};
const int N = 5e5;
int a[N];
char d[N];
int x[N];

void solve() {
    string ans;
    int n; cin >> n;
    char initPos = '\0';
    for (int i = 1; i <= n; i++) {
        cin >> d[i] >> x[i];

        if (i == 1) {
            initPos = d[i];
        } else {
            if (d[i] == d[i-1]) {
                ;
            } else if (d[i-1] == 'N') {
                if (d[i] == 'S') {
                    ;
                } else if (d[i] == 'W') {
                    ans += 'L';
                } else if (d[i] == 'E') {
                    ans += 'R';
                }
            } else if (d[i-1] == 'S') {
                if (d[i] == 'N') {
                    ;
                } else if (d[i] == 'W') {
                    ans += 'R';
                }
                else if (d[i] == 'E') {
                    ans += 'L';
                }
            } else if (d[i-1] == 'W') {
                if (d[i] == 'N') {
                    ans += 'R';
                } else if (d[i] == 'S') {
                    ans += 'L';
                } else if (d[i] == 'E') {
                    ;
                }
            } else if (d[i-1] == 'E') {
                if (d[i] == 'N') {
                    ans += 'L';
                } else if (d[i] == 'S') {
                    ans += 'R';
                } else if (d[i] == 'W') {
                    ;
                }
            }
        }
        ans += string(x[i], 'Z');
    }

    vector<string> final;
    for (int i = 0; i < ans.size(); i++) {
        if (ans[i] == 'Z') {
            int j = i;
            while (j< ans.size() && ans[j] == 'Z') {
                j++;
            }
            final.push_back("Z " + to_string(j-i));
            i = j-1;
        } else {
            final.push_back(string(1, ans[i]));
        }
    }

    cout << final.size() << ' ' << initPos << '\n';
    for (auto x: final) cout << x << '\n';
}
signed main() {
    fastIO();
    int _ = 1; cin >> _;
    while (_--) {
        solve();
    }

    return 0;
}