#include <bits/stdc++.h>

using namespace std;
#define ll long long

const int N = 3e3 + 10;

ll T, n, len;
string turn;
int nx[200], ny[200];

void solve() {
    cin >> n;
    int x = 0, y = 0;
    for (int i = 1; i <= n; i++) {
        cin >> turn >> len;
        x += nx[turn[0]] * len, y += ny[turn[0]] * len;
    }
    int m = 0;
    if (x == 0 && y == 0) {
        cout << "7 S\nZ 1\nL\nZ 1\nL\nZ 1\nL\nZ 1\n";
        return;
    }
    if (x != 0 && y != 0) {
        m = 3;
        cout << m << " ";
        if (x >= 0) cout << "N\n";
        else cout << "S\n";
        if (x != 0) {
            cout << "Z " << abs(x) << "\n";
        }
        if (y != 0) {
            if ((x >= 0 && y > 0) || (x < 0 && y < 0)) cout << "R\n";
            else cout << "L\n";
            cout << "Z " << abs(y) << "\n";
        }
    } else {
        char st;
        if (x > 0) st = 'N';
        if (x < 0) st = 'S';
        if (y > 0) st = 'E';
        if (y < 0) st = 'W';
        cout << 1 << " " << st << "\n";
        cout << "Z " << abs(x + y) << "\n";
    }
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr), std::cout.tie(nullptr);

    nx['N'] = 1, nx['S'] = -1, ny['W'] = -1, ny['E'] = 1;

    cin >> T;
    while (T--) {
        solve();
    }


    return 0;
}

/*
8
2
S 2
E 1
2
N 2
E 1
2
S 2
W 1
2
N 2
W 1
1
W 1
1
E 1
1
S 1
1
N 1
 */