#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>

int main() {
    using namespace std;
    cin.tie(nullptr)->sync_with_stdio(false);
    int N; cin >> N; string S; cin >> S;

    auto get_nxt = [&](const char& c, const array<int64_t, 2>& cur) -> array<int64_t, 2> {
        if (c == 'U') {
            return {cur[0], cur[1] + 1};
        }
        if (c == 'R') {
            return {cur[0] + 1, cur[1]};
        }
        if (c == 'D') {
            return {cur[0], cur[1] - 1};
        }
        if (c == 'L') {
            return {cur[0] - 1, cur[1]};
        }
        return {0, 0};
    };

    const int offset = 30;
    set<array<int64_t, 2>> path;
    for (int mask = 0; mask < (1 << N); ++mask) {
        vector<vector<int>> vis(60, vector<int>(60, -1));
        vector<vector<int>> exists(60, vector<int>(60, 0));

        array<int64_t, 2> cur = {0, 0};
        bool ok = true;
        vis[cur[0] + offset][cur[1] + offset] = 1;
        exists[cur[0] + offset][cur[1] + offset] = 1;
        for (int x = 0; x < N && ok; ++x) {
            auto nxt = get_nxt(S[x], cur);
            if (mask & (1 << x)) {
                cur = nxt;
                if (~vis[nxt[0] + offset][nxt[1] + offset]) {
                    if (exists[nxt[0] + offset][nxt[1] + offset] == 0) ok = false;
                }
                exists[nxt[0] + offset][nxt[1] + offset] = 1;
                vis[nxt[0] + offset][nxt[1] + offset] = 1;
            } else {
                if (~vis[nxt[0] + offset][nxt[1] + offset]) {
                    if (exists[nxt[0] + offset][nxt[1] + offset] == 1) ok = false;
                }
                exists[nxt[0] + offset][nxt[1] + offset] = 0;
                vis[nxt[0] + offset][nxt[1] + offset] = 0;
            }
        }
        if (ok) {
            path.insert(cur);
        }
    }

    // sort(path.begin(), path.end());
    // path.erase(unique(path.begin(), path.end()), path.end());
    cout << int(path.size()) << '\n';
    for (auto [a, b] : path) {
        cout << a << ' ' << b << '\n';
    }
}