#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const string type = "LRDU";

void solve() {
    int n;
    string s;
    cin >> n >> s;
    vector<int> d(n);
    for (int i = 0; i < n; i++) {
        for (int x = 0; x < 4; x++) {
            if (type[x] == s[i]) {
                d[i] = x;
                break;
            }
        }
    }
    vector<vector<int>> used(2 * n + 1, vector<int>(2 * n + 1, -1));
    int cnt_used = 0;
    vector<vector<bool>> ans(2 * n + 1, vector<bool>(2 * n + 1, false));
    for (int mask = 0; mask < (1 << n); mask++) {
        cnt_used += 2;
        int x = n;
        int y = n;
        bool ok = true;
        for (int i = 0; i < n; i++) {
            int gx = x + dx[d[i]];
            int gy = y + dy[d[i]];
            if ((mask >> i) & 1) {
                if (used[gx][gy] == cnt_used) {
                    ok = false;
                    break;
                }
                used[gx][gy] = cnt_used + 1;
            } else {
                if (used[gx][gy] == cnt_used + 1) {
                    ok = false;
                    break;
                }
                used[gx][gy] = cnt_used;
                x = gx;
                y = gy;
            }
        }
        if (ok && used[n][n] != cnt_used + 1) {
            ans[x][y] = true;
        }
    }
    vector<pair<int, int>> res;
    for (int x = -n; x <= n; x++) {
        for (int y = -n; y <= n; y++) {
            if (ans[x + n][y + n]) {
                res.emplace_back(x, y);
            }
        }
    }
    cout << res.size() << "\n";
    for (const auto& t : res) {
        cout << t.first << " " << t.second << "\n";
    }
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}