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

void solve() {
    int n;
    cin >> n;
    string s;
    cin >> s;
    vector<pair<int, int>> res;
    int base = 25;
    vector<vector<bool>> obs(51, vector<bool>(51, false)),
        not_obs(51, vector<bool>(51, false));
    not_obs[0 + base][0 + base] = 1;
    function<void(int, int, int)> dfs = [&](int now, int nowx, int nowy) {
        if (now == n) {
            res.emplace_back(nowx, nowy);
            return;
        }
        int nx = nowx, ny = nowy;
        if (s[now] == 'L') {
            nx--;
        } else if (s[now] == 'R') nx++;
        else if (s[now] == 'D') ny--;
        else ny++;
        if (!obs[nx + base][ny + base]) {
            bool old = not_obs[nx + base][ny + base];
            not_obs[nx + base][ny + base] = 1;
            dfs(now + 1, nx, ny);
            not_obs[nx + base][ny + base] = old;
        }
        if (!not_obs[nx + base][ny + base]) {
            bool old = obs[nx + base][ny + base];
            obs[nx + base][ny + base] = 1;
            dfs(now + 1, nowx, nowy);
            obs[nx + base][ny + base] = old;
        }
    };
    dfs(0, 0, 0);
    ranges::sort(res);
    res.erase(ranges::unique(res).begin(), res.end());
    cout << res.size() << "\n";
    for (auto [x, y] : res)
        cout << x << " " << y << "\n";
    // cout << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
}