#include <bits/stdc++.h>
using namespace std;
const int maxn=1e6+10;
const int N=20+5;
set<pair<int,int>> sp;
pair<int, int> d[N];
int mp[45][45], vis[45][45];
int n;
void dfs(int cur, int x, int y){
	//cout<<x<<" "<<y<<"\n";
	++vis[x][y];
	if(cur==n){
		sp.insert(make_pair(x-21, y-21));
		--vis[x][y];
		return;
	}
	auto&& [dx, dy]=d[cur];
	if(mp[x+dx][y+dy]){
		dfs(cur+1, x,y);
	}else{
		if(!vis[x+dx][y+dy]){
			mp[x+dx][y+dy]=1;
			dfs(cur+1, x,y);
			mp[x+dx][y+dy]=0;
		}
		dfs(cur+1, x+dx, y+dy);
	}
	--vis[x][y];
}
void solve(){
	cin>>n;
	char c;
	for(int i=0; i<n; ++i){
		cin>>c;
		if(c=='L'){
			d[i]=make_pair(-1, 0);
		}else if(c=='R'){
			d[i]=make_pair(1, 0);
		}else if(c=='D'){
			d[i]=make_pair(0, -1);
		}else{
			d[i]=make_pair(0, 1);
		}
	}
	dfs(0, 21, 21);
	cout<<sp.size()<<"\n";
	for(auto&& [x,y] : sp) cout<<x<<" "<<y<<"\n";
}
int main()
{
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	//fstream in("in.txt",ios::in);cin.rdbuf(in.rdbuf());
	int T=1;
	while(T--)solve();
}