#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int dx[4] = {0, 1, 0, -1};//U R D L
int dy[4] = {1, 0, -1, 0};
string mp = "URDL";
int n;
int Get(char ch) {
    if (ch == 'U') return 0;
    if (ch == 'R') return 1;
    if (ch == 'D') return 2;
    if (ch == 'L') return 3;
}
void Solve() {
    cin >> n;
    int cur;
    char ans;
    vector<pair<char,int>> vec;
    char last;
    for (int i = 1; i <= n; i++) {
        char ch;
        int len;
        cin >> ch >> len;
        if (i == 1) {
            ans = ch;
            cur = Get(ch);
            vec.push_back({'Z', len});
        }
        else {
            if (mp[(cur + 1) % 4] == 'ch') {
                vec.push_back({'R', 0});
                cur = (cur + 1) % 4;
                vec.push_back({'Z', len});
            }
            else {
                vec.push_back({'L', 0});
                cur = (cur + 3) % 4;
                vec.push_back({'Z', len});
            }
        }
        last = ch;
    }
    cout << vec.size() << ' ' << ans << endl;;
    for (auto [ch, len]: vec) {
        cout << ch << ' ';
        if (ch == 'Z') cout << len;
        cout << endl;
    }
}
int main() {
    //freopen("in", "r", stdin);
    //freopen("out", "w", stdout);
    int T;
    cin >> T;
    while (T--){
        Solve();
    }
    return 0;
}