#include <bits/stdc++.h>
using namespace std;

#define rep(i, N) for (int i = 0; i < (N); i++)
#define pb push_back

using ll = long long;

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

int main() {
    int N;
    cin >> N;
    string s;
    cin >> s;
    vector<int> a(N);
    rep(i, N) {
        char c = s[i];
        if (c == 'L') {
            a[i] = 0;
        }
        if (c == 'U') {
            a[i] = 3;
        }
        if (c == 'R') {
            a[i] = 2;
        }
        if (c == 'D') {
            a[i] = 1;
        }
    }

    vector<vector<int>> b0(N * 2 + 1, vector<int>(N * 2 + 1, -1));
    vector<vector<int>> b1(N * 2 + 1, vector<int>(N * 2 + 1, -1));

    set<tuple<int, int>> ans;

    rep(S, 1 << N) {
        b0[N][N] = S;
        int y = 0, x = 0;
        bool ok = true;
        rep(i, N) {
            if (S >> i & 1) {
                y += dy[a[i]];
                x += dx[a[i]];
                b0[N + y][N + x] = S;
                if (b1[N + y][N + x] == S) {
                    ok = false;
                }
            } else {
                b1[N + y + dy[a[i]]][N + x + dx[a[i]]] = S;
                if (b0[N + y + dy[a[i]]][N + x + dx[a[i]]] == S) {
                    ok = false;
                }
            }
        }
        if (ok) {
            ans.insert(make_tuple(x, y));
        }
    }

    cout << ans.size() << endl;
    for (auto [x, y] : ans) {
        cout << x << ' ' << y << endl;
    }
}