//prepare for coding{{{
//preparaton{{{
#include<bits/stdc++.h>

#define RELEASE
#ifdef RELEASE
#define DB(...) ;
#else
//#define FILE
#ifdef FILE
#define DB(...) fprintf(stderr,__VA_ARGS__)
#else
#define DB printf
#endif
#endif 
//#define MOD_OPERATOR
//#define CMP_OPERATOR
//#define GRP_OPERATOR
//}}}

//constants{{{
const int N=20;
const int FX[4]={-1,+1,0,0},FY[4]={0,0,-1,1};
//}}}

//std{{{
using namespace std;
//}}}

//input and output{{{
inline int Read(){
	char c=getchar();
	int res=0;
	bool b=0;
	while(c>'9'||c<'0')
		b=(c=='-'),c=getchar();
	while(c>='0'&&c<='9')
		res=(res<<3)+(res<<1)+c-'0',c=getchar();
	return b?-res:res;
}

inline int ReadC(){
	char c=getchar();
	while(c!='L'&&c!='R'&&c!='D'&&c!='U')
		c=getchar();
	return c=='L'?0:(c=='R'?1:(c=='D'?2:3));
}
//}}}

//other small functions{{{
//}}}

//variables{{{
int n;
int dr[N+10];
//}}}

//modulo operators{{{
#ifdef MOD_OPERATOR
const int MOD=998244353;

inline int Add(int a,int b){
	return a+b<MOD?a+b:a+b-MOD;
}

inline int MAdd(int &x,int y){
	return (x+=y)<MOD?x:x-=MOD;
}

inline int Mul(int a,int b){
	return 1ll*a*b%MOD;
}

inline int MMul(int &x,int y){
	return x=1ll*x*y%MOD;
}

inline int Pow(int x,int b=MOD-2){
	int res=1;
	while(b){
		if(b&1)
			MMul(res,x);
		MMul(x,x);
		b>>=1;
	}
	return res;
}
#endif
//}}}

//compare operators{{{
inline int Max(int a,int b){
	return a<b?b:a;
}

inline int CMX(int &x,int y){
	return x<y?x=y:x;
}

inline int Min(int a,int b){
	return a>b?b:a;
}

inline int CMN(int &x,int y){
	return x>y?x=y:x;
}
//}}}

//graph operators{{{
#ifdef GRP_OPERATOR
int te=1,head[N+10];
int s,t;

struct EDGE{
	int n,t;
}e[N*2+10];

inline void Adde(int u,int v){
	e[++te].n=head[u];
	e[te].t=v;
	head[u]=te;
	e[++te].n=head[v];
	e[te].t=u;
	head[v]=te;
}
#endif
//}}}
//}}}

//solve{{{
int mp[2*N+10][2*N+10];
bool ok[2*N+10][2*N+10];

inline void DFS(int x,int y,int d){
	if(d==n+1)
		return ok[x][y]=1,void();
	int nx=x+FX[dr[d]],ny=y+FY[dr[d]];
	int tmp=mp[nx][ny];
	if(~tmp){
		mp[nx][ny]=1;
		DFS(nx,ny,d+1);
	}
	if(tmp^1){
		mp[nx][ny]=-1;
		DFS(x,y,d+1);
	}
	mp[nx][ny]=tmp;
}
//}}}

//main{{{
signed main(){
#ifdef FILE
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
#endif
	n=Read();
	for(int i=1;i<=n;++i)
		dr[i]=ReadC();
	mp[n][n]=1;
	DFS(n,n,1);
	int ans=0;
	for(int i=0;i<=n*2;++i)
		for(int j=0;j<=n*2;++j)
			ans+=ok[i][j];
	printf("%d\n",ans);
	for(int i=0;i<=n*2;++i)
		for(int j=0;j<=n*2;++j)
			if(ok[i][j])
				printf("%d %d\n",i-n,j-n);
	return 0;
}
//}}}
//《象》曰：泽灭木，大过。君子以独立不惧，遁世无闷。