#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>

using namespace std;

// BEGIN NO SAD
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
typedef vector<int> vi;
#define f first
#define s second
#define derr if(0) cerr
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
 
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<" [" << #x << "] = ["; _print(x); cerr << "\e[39m" << flush;
// END NO SAD

template<class Fun>
class y_combinator_result {
  Fun fun_;
public:
  template<class T>
  explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}

  template<class ...Args>
  decltype(auto) operator()(Args &&...args) {
    return fun_(std::ref(*this), std::forward<Args>(args)...);
  }
};

template<class Fun>
decltype(auto) y_combinator(Fun &&fun) {
  return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));
}

template<class T>
bool updmin(T& a, T b) {
  if(b < a) {
    a = b;
    return true;
  }
  return false;
}
template<class T>
bool updmax(T& a, T b) {
  if(b > a) {
    a = b;
    return true;
  }
  return false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> matrix;

void rsolve() {
  int n;
  cin >> n;
  int x = 0, y = 0;
  while(n--) {
    char op;
    int d;
    cin >> op >> d;
    if(op == 'N') y += d;
    else if(op == 'S') y -= d;
    else if(op == 'E') x += d;
    else x -= d;
  }
  vector<string> ops;
  char dir = 'N';
  if(x == 0 && y == 0) {
    ops.pb("Z 1");
    ops.pb("L");
    ops.pb("Z 1");
    ops.pb("L");
    ops.pb("Z 1");
    ops.pb("L");
    ops.pb("Z 1");
  }
  else if(x == 0) {
    if(y > 0) {
      dir = 'N';
      ops.pb("Z " + to_string(abs(y)));
    }
    else if(y < 0) {
      dir = 'S';
      ops.pb("Z " + to_string(abs(y)));
    }
    else assert(false);
  }
  else if(y == 0) {
    if(x > 0) {
      dir = 'E';
      ops.pb("Z " + to_string(abs(x)));
    }
    else if(x < 0) {
      dir = 'W';
      ops.pb("Z " + to_string(abs(x)));
    }
    else assert(false);
  }
  else {
    dir = (y > 0 ? 'N' : 'S');
    ops.pb("Z " + to_string(abs(y)));
    if(x > 0 && y > 0) ops.pb("R");
    else if(x < 0 && y < 0) ops.pb("R");
    else ops.pb("L");
    ops.pb("Z " + to_string(abs(x)));
  }
  cout << sz(ops) << " " << dir << "\n";
  for(auto out: ops) cout << out << "\n";
}
void solve() {
  int t;
  cin >> t;
  while(t--) rsolve();
}

// what would chika do
// are there edge cases?
// did you actually sort the thing instead of just thinking it?
// integer overflow?

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  solve();
}