#include <cstdio>
const int N = 110;
int read() {
    int x = 0, v = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') v = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        x = (x << 1) + (x << 3) + (c ^ 48);
        c = getchar();
    }
    return x * v;
}
int n;
char str[N];
bool ansMap[N][N];
int vis[N][N], mine[N][N];
const int dx[4] = {-1, 1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
int getPos(char c) {
    if (c == 'L') return 0;
    if (c == 'R') return 1;
    if (c == 'U') return 2;
    return 3;
}
void dfs(int x, int y, int step) {
    if (step == n) {
        ansMap[x][y] = 1;
        return;
    }
    int pos = getPos(str[step]);
    int xx = x + dx[pos];
    int yy = y + dy[pos];
    if (xx == n && yy == n) {
        dfs(xx, yy, step + 1);
    } else {
        if (!vis[xx][yy]) {
            ++vis[xx][yy];
            dfs(xx, yy, step + 1);
            mine[xx][yy] = 1;
            dfs(x, y, step + 1);
            mine[xx][yy] = 0;
            --vis[xx][yy];
        } else {
            ++vis[xx][yy];
            if (mine[xx][yy]) {
                dfs(x, y, step + 1);
            } else {
                dfs(xx, yy, step + 1);
            }
            --vis[xx][yy];
        }
    }
}
int main() {
    n = read();
    scanf("%s", str);
    dfs(n, n, 0);
    int ans = 0;
    for (int i = 0; i <= (n << 1); ++i) {
        for (int j = 0; j <= (n << 1); ++j) {
            ans += ansMap[i][j];
        }
    }
    printf("%d\n", ans);
    for (int i = 0; i <= (n << 1); ++i) {
        for (int j = 0; j <= (n << 1); ++j) {
            if (ansMap[i][j]) {
                printf("%d %d\n", i - n, j - n);
            }
        }
    }
    return 0;
}