#include <iostream>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

int n;
string str;
pair <int, int> moves[21];
vector <pair<int, int>> ans;
map<pair<int, int>, int> mp;

void bkt(int k, pair <int, int> poz) {
    if (k == n) {
        ans.push_back(poz);
        return;
    }
    pair <int, int> newPoz = poz;
    newPoz.first += moves[k].first;
    newPoz.second += moves[k].second;
    if (mp[newPoz] == -1) {
        bkt(k + 1, poz);
    }
    if (mp[newPoz] == 1) {
        bkt(k + 1, newPoz);
    }
    if (mp[newPoz] == 0) {
        mp[newPoz] = -1;
        bkt(k + 1, poz);
        mp[newPoz] = 1;
        bkt(k + 1, newPoz);
        mp[newPoz] = 0;
    }
}

int main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    cin >> n;
    cin >> str;
    for (int i = 0; i < n; i++) {
        if (str[i] == 'L') {
            moves[i] = {-1, 0};
        }
        if (str[i] == 'R') {
            moves[i] = {1, 0};
        }
        if (str[i] == 'D') {
            moves[i] = {0, -1};
        }
        if (str[i] == 'U') {
            moves[i] = {0, 1};
        }
    }
    pair <int, int> orig = {0, 0};
    mp[orig] = 1;
    bkt(0, orig);
    sort(ans.begin(), ans.end());
    ans.erase(unique(ans.begin(), ans.end()), ans.end());
    cout << (int) ans.size() << '\n';
    for (auto p : ans) {
        cout << p.first << ' ' << p.second << '\n';
    }
    return 0;
}