#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e6 + 10;
#define pii pair<int, int>
#define lowbit(x) (x & (-x))
const int mod = 1e9 + 7;
void solve()
{
    int n;
    cin >> n;
    int x = 0, y = 0;
    for (int i = 0; i < n; i++)
    {
        char c;
        int d;
        cin >> c >> d;
        if (c == 'W')
            y -= d;
        if (c == 'E')
            y += d;
        if (c == 'N')
            x -= d;
        if (c == 'S')
            x += d;
    }
    if (x == 0)
    {
        if (y > 0)
        {
            cout << "1 E" << endl;
            cout << "Z " << y << endl;
        }
        else
        {
            cout << "1 W" << endl;
            cout << "Z " << -y << endl;
        }
    }
    else if (y == 0)
    {
        if (x > 0)
        {
            cout << "1 S" << endl;
            cout << "Z " << x << endl;
        }
        else
        {
            cout << "1 N" << endl;
            cout << "Z " << -x << endl;
        }
    }
    else
    {
        if (x < 0)
        {
            cout << "3 N" << endl;
            cout << "Z " << -x << endl;
            if (y > 0)
            {
                cout << "R" << endl;
                cout << "Z " << y << endl;
            }
            else
            {
                cout << "L" << endl;
                cout << "Z " << -y << endl;
            }
        }
        else
        {
            cout << "3 S" << endl;
            cout << "Z " << x << endl;
            if (y > 0)
            {
                cout << "L" << endl;
                cout << "Z " << y << endl;
            }
            else
            {
                cout << "R" << endl;
                cout << "Z " << -y << endl;
            }
        }
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    while (t--)
        solve();
}