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

using ll = long long;
#define int ll
#define all(v) (v).begin(), (v).end()
#define pb push_back

void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

int n;
string s;

void solve() {
    cin >> n >> s;

    const int INF = 1e8;

    auto walk = [&] (char c) -> pair<int, int> {
        if (c == 'L') return {-1, 0};
        if (c == 'R') return {1, 0};
        if (c == 'D') return {0, -1};
        return {0, 1};
    };

    auto check = [&] (int mask) -> pair<int, int> {
        int x = 0, y = 0;
        set<pair<int, int>> bad, good;
        good.insert ({x, y});
        for (int i = 0; i < n; i++) {
            int bit = mask >> i & 1;

            auto [dx, dy] = walk (s[i]);
            if (bit) {
                // se eu for andar
                x += dx; y += dy;
                if (bad.find ({x, y}) != bad.end ()) return {INF, INF};
                good.insert ({x, y});
            }
            else {
                if (good.find ({x + dx, y + dy}) != good.end ()) return {INF, INF};
                bad.insert ({x + dx, y + dy});
            }
        }
        return {x, y};
    };

    vector<pair<int, int>> ans;
    for (int mask = 0; mask < (1 << n); mask++) {
        auto [x, y] = check (mask);
        if (x != INF) {
            // dbg (mask, x, y);
            ans.pb ({x, y});
        }
    }

    sort (all (ans));
    ans.resize (unique (all (ans)) - ans.begin ());
    cout << ans.size () << "\n";
    for (auto [x, y] : ans) cout << x << " " << y << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    solve();
}