#include <bits/stdc++.h>

int good[50][50];
int bad[50][50];
const int B = 22;

int main(){
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    int n;
    std::cin >> n;
    std::string s;
    std::cin >> s;

    auto get = [](char c)-> std::pair<int, int> {
        if (c == 'L') {
            return {-1, 0};
        }
        if (c == 'R') {
            return {1, 0};
        }
        if (c == 'U') {
            return {0, 1};
        }
        if (c == 'D') {
            return {0, -1};
        }
		assert(0);
    };

    std::vector<std::pair<int, int> > res;
    for (int i = 0; i < (1 << n); i += 1) {
        good[B + 0][B + 0] = 1;
        int x = 0, y = 0;
        bool nice = true;
        std::vector<std::pair<int, int> > used;
        for (int j = 0; j < n; j += 1) {
            auto [dx, dy] = get(s[j]);
            int nx = x + dx;
            int ny = y + dy;

            if (i >> j & 1) {
                if (bad[B + nx][B + ny] == 1) {
                    nice = false;
                    break;
                }
                good[B + nx][B + ny] = 1;
                used.emplace_back(nx, ny);
                x = nx;
                y = ny;
            }
            else {
                if (good[B + nx][B + ny] == 1) {
                    nice = false;
                    break;
                }
                bad[B + nx][B + ny] = 1;
                used.emplace_back(nx, ny);
            }
        }
        for (auto [x, y] : used) {
            bad[B + x][B + y] = 0;
            good[B + x][B + y] = 0;
        }
        if (nice) {
            res.emplace_back(x, y);
        }
    }
    std::sort(res.begin(), res.end());
    res.erase(std::unique(res.begin(), res.end()), res.end());
    std::cout << res.size() << "\n";
    for (auto [x, y] : res) {
        std::cout << x << " " << y << "\n";
    }
    return 0;
}