#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=30;
int n,a[N];
int st[60][60];
int can[60][60];
bool use[60][60];
int d[4][2]={
    {-1,0},{1,0},{0,1},{0,-1}
};
struct pt{
    int x,y;
}ans[60*60];int cnt;
//0:30
/*
void debug(int t){
    for(int i=1;i <= n;i++){
        cerr << ((t >> (i-1))&1);
    }
    cerr << "\n";
}
*/
int main(){
    //freopen("explore.in","r",stdin);
    //freopen("explore.out","w",stdout);

    scanf("%d",&n);
    for(int i=1;i <= n;i++){
        int x=getchar();
        while(x == ' ' || x == '\n') x=getchar();
        if(x == 'L') a[i]=0;
        else if(x == 'R') a[i]=1;
        else if(x == 'U') a[i]=2;
        else  a[i]=3;
    }
    for(int t=0;t < (1 << n);t++){
        int tag=t+1;
        int x=30,y=30;
        bool flag=true;
        for(int i=1;i <= n;i++){
            can[x][y]=tag;
            if(!((t >> (i-1))&1)){
                //debug(t);
                int dx=x+d[a[i]][0],dy=y+d[a[i]][1];
                if(can[dx][dy] == tag){
                    flag=false;
                    break;
                }
                if(st[dx][dy] != tag) st[dx][dy]=tag;
            } else {
                int dx=x+d[a[i]][0],dy=y+d[a[i]][1];
                if(st[dx][dy] == tag){
                    flag=false;
                    break;
                }
                x=dx,y=dy;
            }
        }
        if(flag) {
            //debug(t);
            use[x][y]=true;
        }
    }
    for(int i=30-n;i <= 30+n;i++){
        for(int j=30-n;j <= 30+n;j++){
            if(use[i][j]) ans[cnt++]={i-30,j-30};
        }
    }
    printf("%d\n",cnt);
    for(int i=0;i<cnt;i++) printf("%d %d\n",ans[i].x,ans[i].y);
    return 0;
}

/*
g++ explore.cpp -o explore -std=c++14 -O2 -static -Wall -Wextra -fsanitize=undefined
./explore < explore.in > explore.out
*/