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

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n;
        cin >> n;

        string s;
        cin >> s;

        set<pair<int, int>> ans;

        for (int m = 0; m < 1 << n; m++) {
            bool ok = true;
            int x = 0, y = 0;
            map<pair<int, int>, int> must;
            must[{0, 0}] = 0;
            for (int i = 0; i < n; i++) {
                int nx = x, ny = y;
                if (s[i] == 'L') {
                    nx--;
                } else if (s[i] == 'R') {
                    nx++;
                } else if (s[i] == 'D') {
                    ny--;
                } else if (s[i] == 'U') {
                    ny++;
                }
                if (m >> i & 1) {
                    if (auto it = must.emplace(pair(nx, ny), 1).first; it->second == 0) {
                        ok = false;
                    }
                } else {
                    if (auto it = must.emplace(pair(nx, ny), 0).first; it->second == 1) {
                        ok = false;
                    }
                    x = nx, y = ny;
                }
            }
            if (ok) {
                ans.emplace(x, y);
            }
        }

        cout << ans.size() << '\n';
        for (auto [x, y] : ans) {
            cout << x << ' ' << y << '\n';
        }
    };
    
    solve();
    
    return 0;
}