#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 20,MAXM = 50,X = 20;

int n;
char s[MAXN+1];

typedef array<int,2> pr;

vector<pr>o;

int tag[MAXM][MAXM];
vector<pr>pos;

void clr(){
	for(auto [x,y] : pos)tag[x+X][y+X] = 0;
}
int sv(int x,int y){ //强制不能走
	pos.push_back({x,y});

	if(tag[x+X][y+X] == 1)return 0;
	else return (tag[x+X][y+X] = -1),1;
}
int sf(int x,int y){ //强制能走
	pos.push_back({x,y});

	if(tag[x+X][y+X] == -1)return 0;
	else return (tag[x+X][y+X] = 1),1;
}

void chk(int mask){
	clr();pos.clear();
	//
	sf(0,0);

	int x = 0,y = 0;
	rep(i,0,n-1){
		int cx = x,cy = y;

		if(s[i] == 'L')cx--;
		else if(s[i] == 'R')cx++;
		else if(s[i] == 'D')cy--;
		else cy++;

		if(mask>>i&1){
			if(!sf(cx,cy))return;
			x = cx,y = cy;
		}else{	
			if(!sv(cx,cy))return;
		}
	}
	o.push_back({x,y});
}

int main(){
	cin>>n>>s;	

	rep(mask,0,(1<<n)-1){
		chk(mask);
	}

	sort(o.begin(),o.end());
	o.erase(unique(o.begin(),o.end()),o.end());

	cout<<o.size()<<"\n";
	for(auto [x,y] : o)cout<<x<<" "<<y<<"\n";
    return 0;
}