#include <bits/stdc++.h>
#define rep(i,l,r) for(int i=l; i<=r; i++)
#define IOS {cin.tie(0);cout.tie(0);ios::sync_with_stdio(0);}
using namespace std;

typedef long long ll;
typedef pair<int,int> P;

char s[100];
int vis[200][200], n, ccc[200][200];
P ksj[2000010];
int cnt;

int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};

void dfs(int t, int x, int y) {
    if (t == n+1) {
        if (!ccc[x][y]) ksj[++cnt] = P(x, y);
        ccc[x][y] = 1;
        return;
    }
    int k;
    if (s[t] == 'U') k = 0;
    if (s[t] == 'D') k = 1;
    if (s[t] == 'L') k = 2;
    if (s[t] == 'R') k = 3;
    int tx = x + dx[k], ty = y + dy[k];
    if (vis[tx][ty] == 1) dfs(t+1, tx, ty);
    else if (vis[tx][ty] == -1) dfs(t+1, x, y);
    else {
        vis[tx][ty] = 1;
        dfs(t+1, tx, ty);
        vis[tx][ty] = -1;
        dfs(t+1, x, y);
        vis[tx][ty] = 0;
    }
}

int main() {
    scanf("%d", &n);
    scanf("%s", s+1);
    vis[0+20][0+20] = 1;
    dfs(1, 20, 20);
    sort(ksj+1, ksj+cnt+1);
    cout << cnt << '\n';
    rep (i, 1, cnt) cout << ksj[i].first-20 <<' '<< ksj[i].second-20<<'\n';
    return 0;
}