//#pragma GCC optimize("Ofast", "unroll-loops")
//#pragma GCC target("sse", "sse2", "sse3", "ssse3", "sse4")
#ifdef LOCAL
#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstdint>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <random>
#include <deque>
#include <functional>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <complex>
#include <numeric>
#include <cassert>
#include <array>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <thread>
#else
#include <bits/stdc++.h>
#endif

#define all(a) a.begin(),a.end()
#define len(a) (int)(a.size())
#define mp make_pair
#define pb push_back
#define fir first
#define sec second
#define fi first
#define se second

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;

template<typename T>
inline bool umin(T &a, T b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

template<typename T>
inline bool umax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

#ifdef LOCAL
#define D for (bool _FLAG = true; _FLAG; _FLAG = false)
#define LOG(...) print(#__VA_ARGS__" ::", __VA_ARGS__) << endl
template <class ...Ts> auto &print(Ts ...ts) { return ((cerr << ts << " "), ...); }
#else
#define D while (false)
#define LOG(...)
#endif // LOCAL

const int max_n = -1, inf = 1000111222;


inline int gox (char c) {
    if (c == 'L') {
        return -1;
    }
    if (c == 'R') {
        return 1;
    }
    return 0;
}

inline int goy (char c) {
    if (c == 'D') {
        return -1;
    }
    if (c == 'U') {
        return 1;
    }
    return 0;
}


int main() {
//    freopen("input.txt", "r", stdin);
//    freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    string s;
    cin >> s;
    set <pii> ans;
    set <pii> bad;
    for (int mask = 0; mask < (1 << n); mask++) {
        int x = 0, y = 0;
        bad.clear();
        for (int i = 0; i < n; i++) {
            int tox = x + gox(s[i]);
            int toy = y + goy(s[i]);
            if (mask & (1 << i)) {
                bad.insert({tox, toy});
                continue;
            }
            if (bad.count({tox, toy})) {
                continue;
            }
            x = tox;
            y = toy;
        }
        if (bad.count({0, 0})) {
            continue;
        }
        x = y = 0;
        bool ok = true;
        for (int i = 0; i < n; i++) {
            int tox = x + gox(s[i]);
            int toy = y + goy(s[i]);
            if (bad.count({tox, toy})) {
                continue;
            }
            x = tox;
            y = toy;
        }
        ans.insert({x, y});
    }
    cout << len(ans) << '\n';
    for (auto &i : ans) {
        cout << i.first << ' ' << i.second << '\n';
    }
}