#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    string s; cin >> s;
    vector<pair<int,int>> res;
    for (int i = 0; i < (1<<n); ++i) {
        int x = 0, y = 0;
        bool valid = true;
        set<pair<int,int>> ng, ok;
        ok.insert({x, y});
        for (int j = 0; j < n; ++j) {
            int nx = x, ny = y;
            if (s[j] == 'L') nx -= 1;
            else if (s[j] == 'R') nx += 1;
            else if (s[j] == 'D') ny -= 1;
            else ny += 1;
            pair<int,int> nxt = {nx, ny};

            if ((1<<j)&i) {
                if (ng.find(nxt) != ng.end()) {
                    valid = false;
                    break;
                }
                ok.insert({nxt});
                x = nx, y = ny;
            }
            else {
                // 本当は障害物があるはず
                if (ok.find(nxt) != ok.end()) {
                    valid = false;
                    break;
                }
                ng.insert({nxt});
            }
        }

        if (valid) {
            res.push_back({x, y});
        }
    }

    sort(res.begin(), res.end());
    res.erase(unique(res.begin(), res.end()), res.end());

    cout << res.size() << "\n";
    for (auto p : res) {
        cout << p.first << " " << p.second << "\n";
    }
}