#include <bits/stdc++.h>

using namespace std;

#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()

typedef long long ll;
typedef pair<int, int> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T>
std::ostream& operator << (std::ostream& os, const vector<T>& a) {
    for (const T& x : a) {
        os << x << ' ';
    }
    return os;
}

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

int go(char c) {
    if (c == 'L') return 3;
    if (c == 'R') return 2;
    if (c == 'U') return 0;
    if (c == 'D') return 1;
    return -1;
}

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

    int n;
    string s;
    cin >> n >> s;

    set<pii> output;

    for (int mask = 0; mask < (1 << n); ++mask) {
        set<pii> block;
        set<pii> nonblock;
        int x = 0, y = 0;
        bool ok = true;
        for (int i = 0; i < n; ++i) {
            nonblock.insert({x, y});
            int dir = go(s[i]);
            int nx = x + dx[dir];
            int ny = y + dy[dir];
            if ((mask >> i) & 1) {
                if (block.count({nx, ny})) {
                    ok = false;
                    break;
                }
                x = nx;
                y = ny;
            } else {
                if (nonblock.count({nx, ny})) {
                    ok = false;
                    break;
                }
                block.insert({nx, ny});
            }
        }
        if (ok) {
            output.insert({x, y});
        }
    }

    cout << output.size() << '\n';
    for (auto& [x, y] : output) {
        cout << x << ' ' << y << '\n';
    }

    return 0;
}