#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef double db;
#define int long long
const int N = 2e5 + 5;
const int mod = 1e9 + 7;


void solve() {
    int x1 = 0, y1 = 0;
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        char x;
        int p;
        cin >> x >> p;
        if (x == 'S') {
            x1 -= p;
        } else if (x == 'N') {
            x1 += p;
        } else if (x == 'W') {
            y1 -= p;
        } else {
            y1 += p;
        }
    }
    char s = '1';
    vector<pair<char, int>> ans;
    if (x1 != 0) {
        if (x1 > 0) {
            s = 'N';
            ans.push_back({s, -1});
        } else if (x1 < 0) {
            s = 'S';
            ans.push_back({s, -1});
        }
        ans.push_back({'Z', abs(x1)});
    }
    if (y1 != 0) {
        if (y1 > 0) {
            if (s == '1') {
                s = 'E';
                ans.push_back({s, -1});
            } else if (s == 'N') {
                ans.push_back({'R', -1});
            } else {
                ans.push_back({'L', -1});
            }
        } else if (y1 < 0) {
            if (s == '1') {
                s = 'W';
                ans.push_back({s, -1});
            } else if (s == 'N') {
                ans.push_back({'L', -1});
            } else {
                ans.push_back({'R', -1});
            }
        }
        ans.push_back({'Z', abs(y1)});
    }
    int w1 = ans.size() - 1;
    cout << max(w1, 0ll) << " ";
    for (int i = 0; i < ans.size(); i++) {
        cout << ans[i].first << " ";
        if (ans[i].second != -1) {
            cout << ans[i].second;
        }
        cout << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}