#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)

using namespace std;

const int N = 30;
int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1};
set<pair<int,int>> obstacle, path;
vector<pair<int,int>> ans;
int opr[N];
char str[N];

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    cin >> str;
    rep(i,0,n - 1) {
        if(str[i] == 'R') opr[i] = 0;
        else if(str[i] == 'L') opr[i] = 1;
        else if(str[i] == 'U') opr[i] = 2;
        else opr[i] = 3;
    }
    for(int state = 0; state < (1 << n); ++ state) {
        obstacle.clear();
        path.clear();
        path.insert(make_pair(0, 0));
        bool flg = true;
        int x = 0, y = 0;
        for(int j = 0; j < n; ++ j) {
            int nx = x + dx[opr[j]], ny = y + dy[opr[j]];
            if((state >> j) & 1) {
                if(obstacle.find(make_pair(nx, ny)) != obstacle.end()) {
                    flg = false;
                    break;
                }
                path.insert(make_pair(nx, ny));
                x = nx, y = ny;
            } else {
                if(path.find(make_pair(nx, ny)) != path.end()) {
                    flg = false;
                    break;
                }
                obstacle.insert(make_pair(nx, ny));
            }
        }
        if(flg) ans.push_back(make_pair(x, y));
    }
    sort(ans.begin(), ans.end());
    ans.erase(unique(ans.begin(), ans.end()), ans.end());
    cout << ans.size() << endl;
    for(auto it : ans) {
        cout << it.first << ' ' << it.second << endl;
    }
    return 0;
}