#include<bits/stdc++.h>
using namespace std;
const int N=55;
int n;
char a[N];
int b[N][N],c[N][N],cnt;
struct Node
{
  int x,y;
}ans[(1<<20)+5];
void dfs(int dep,int x,int y)
{
  if(dep==n+1)
  {
    if(c[x][y]) return;
    ans[++cnt].x=x,ans[cnt].y=y;
    c[x][y]=1;
    return;
  }
  int xx=x,yy=y;
  if(a[dep]=='L') xx--;
  else if(a[dep]=='R') xx++;
  else if(a[dep]=='U') yy++;
  else yy--;
  if(b[xx][yy]==2) dfs(dep+1,xx,yy);
  else if(b[xx][yy]==1) dfs(dep+1,x,y);
  else
  {
    b[xx][yy]=2;
    dfs(dep+1,xx,yy);
    b[xx][yy]=1;
    dfs(dep+1,x,y);
    b[xx][yy]=0;
  }
}
bool cmp(Node x,Node y)
{
  return x.x==y.x?x.y<y.y:x.x<y.x;
}
int main()
{
  // freopen("E.in","r",stdin);
  // freopen("E.out","w",stdout);
  scanf("%d",&n);
  for(int i=1;i<=n;i++) scanf("%s",a+1);
  b[20][20]=2;
  dfs(1,20,20);
  sort(ans+1,ans+cnt+1,cmp);
  printf("%d\n",cnt);
  for(int i=1;i<=cnt;i++) printf("%d %d\n",ans[i].x-20,ans[i].y-20);
  return 0;
}