#if __INCLUDE_LEVEL__ == 0

#include __BASE_FILE__

void Solve() {
  int n;
  IN(n);
  vector<pair<int, int>> a(n);
  for (auto& [x, y] : a) {
    char c;
    IN(c);
    x = "SENW"s.find(c);
    IN(y);
  }
  vector<pair<char, int>> ans;
  int cur_dir = a[0].first;
  for (int i : Rep(0, n)) {
    if (((cur_dir + 1) & 3) == a[i].first) {
      ans.emplace_back('L', -1);
      cur_dir = (cur_dir + 1) & 3;
    } else if (((cur_dir - 1) & 3) == a[i].first) {
      ans.emplace_back('R', -1);
      cur_dir = (cur_dir - 1) & 3;
    }
    assert(cur_dir == a[i].first);
    ans.emplace_back('Z', a[i].second);
  }
  OUT(Sz(ans), "SENW"[a[0].first]);
  for (auto [c, x] : ans) {
    if (c == 'Z') {
      OUT(c, x);
    } else {
      OUT(c);
    }
  }
}

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

  int t;
  IN(t);
  while (t--) {
    Solve();
  }
}

#elif __INCLUDE_LEVEL__ == 1

#include <bits/stdc++.h>

template <class T> concept Range = std::ranges::range<T> && !std::convertible_to<T, std::string_view>;
template <class T> concept Tuple = std::__is_tuple_like<T>::value && !Range<T>;

namespace std {

istream& operator>>(istream& is, Range auto&& r) {
  for (auto&& e : r) is >> e;
  return is;
}
istream& operator>>(istream& is, Tuple auto&& t) {
  apply([&](auto&... xs) { (is >> ... >> xs); }, t);
  return is;
}

ostream& operator<<(ostream& os, Range auto&& r) {
  auto sep = "";
  for (auto&& e : r) os << exchange(sep, " ") << e;
  return os;
}
ostream& operator<<(ostream& os, Tuple auto&& t) {
  auto sep = "";
  apply([&](auto&... xs) { ((os << exchange(sep, " ") << xs), ...); }, t);
  return os;
}

}  // namespace std

using namespace std;

#define Rep(...) [](int l, int r) { return views::iota(min(l, r), r); }(__VA_ARGS__)
#define Sz(r) int(size(r))
#define IN(...) (cin >> forward_as_tuple(__VA_ARGS__))
#define OUT(...) (cout << forward_as_tuple(__VA_ARGS__) << '\n')

#endif  // __INCLUDE_LEVEL__ == 1