#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
const int N = 1e5 + 10;
typedef pair<int, int> PII;
int n;string s;
map<char, PII> mp = {{'L', {-1, 0}}, {'R', {1, 0}}, {'D', {0, -1}}, {'U', {0, 1}}};
set<PII> pos;
set<PII> obs;
map<PII,bool> vis;
void dfs(int x, int y, int idx, set<PII> &obs,map<PII,bool> &vis) {
    if (idx == s.size()) {
        pos.insert({x, y});
        return;
    }
    int nx = x + mp[s[idx]].first;
    int ny = y + mp[s[idx]].second;
    if(vis[{nx,ny}] == false) {
        vis[{nx,ny}] = true;
        if (obs.find({nx, ny}) == obs.end()) {
            dfs(nx, ny, idx + 1, obs,vis);
        }
        if(!(nx == 0 && ny ==0)) {
            obs.insert({nx,ny});
            dfs(x, y, idx + 1, obs,vis);
            obs.erase({nx, ny});
        }
    } else {
        if (obs.find({nx, ny}) == obs.end()) {
            dfs(nx, ny, idx + 1, obs,vis);
        }
    }

}

void solve() {
    cin >> n;
    cin >> s;
    dfs(0, 0, 0,obs,vis);
    cout << pos.size() << endl;
    if(pos.size() >= 2) {
        for (auto p : pos) {
            cout << p.first << " " << p.second << endl;
        }
    }
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int _ = 1;
    while (_--) {
        solve();
    }
    return 0;
}