// Problem: B. 【NOIP Round #6】探索
// Contest: Public Judge - Public NOIP Round #6 (Div. 2, 普及)
// URL: https://pjudge.ac/contest/1389/problem/21791
// Create Time: 2024-08-28 07:23:29

#include<iostream>
#include<cstring>
#include<cstdio>
#include<stack>
#include<queue>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
//#define map unordered_map
#define PII pair<int,int>
using namespace std;
/*================*/

inline int read() {
	char c=getchar();int x=0,f=1;
	for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
	for(;isdigit(c);c=getchar())x=x*10+c-48;
	return x*f;
}

#define r(a) (a)=read()

int n;
string s;
vector<PII> ans;
map<PII,bool> vis,obs,path;

void dfs(int x,int y,int step) {
//	cout<<x<<" "<<y<<" "<<step<<" "<<s[step]<<"\n";
	if (step==n) {
		if ((!vis[{x,y}])&&(!obs[{x,y}])) ans.push_back({x,y});
		vis[{x,y}]=1;
	}
	if (s[step]=='L') {
		if (path[{x-1,y}])
			dfs(x-1,y,step+1);
		else if (!obs[{x-1,y}]) {
			path[{x-1,y}]=1;
			dfs(x-1,y,step+1);
			path[{x-1,y}]=0;
			obs[{x-1,y}]=1;
			dfs(x,y,step+1);
			obs[{x-1,y}]=0;
		}
		else {
			dfs(x,y,step+1);
		}
	}
	else if (s[step]=='R') {
		if (path[{x+1,y}])
			dfs(x+1,y,step+1);
		else if (!obs[{x+1,y}]) {
			path[{x+1,y}]=1;
			dfs(x+1,y,step+1);
			path[{x+1,y}]=0;
			obs[{x+1,y}]=1;
			dfs(x,y,step+1);
			obs[{x+1,y}]=0;
		}
		else {
			dfs(x,y,step+1);
		}
	}
	else if (s[step]=='U') {
		if (path[{x,y+1}])
			dfs(x,y+1,step+1);
		else if (!obs[{x,y+1}]) {
			path[{x,y+1}]=1;
			dfs(x,y+1,step+1);
			path[{x,y+1}]=0;
			obs[{x,y+1}]=1;
			dfs(x,y,step+1);
			obs[{x,y+1}]=0;
		}
		else {
			dfs(x,y,step+1);
		}
	}
	else if (s[step]=='D') {
		if (path[{x,y-1}])
			dfs(x,y-1,step+1);
		else if (!obs[{x,y-1}]) {
			path[{x,y-1}]=1;
			dfs(x,y-1,step+1);
			path[{x,y-1}]=0;
			obs[{x,y-1}]=1;
			dfs(x,y,step+1);
			obs[{x,y-1}]=0;
		}
		else {
			dfs(x,y,step+1);
		}
	}
}

signed main() {
	cin>>n>>s;
	path[{0,0}]=1;
	dfs(0,0,0);
	printf("%d\n",ans.size());
	sort(ans.begin(),ans.end());
	for (auto c:ans)
		printf("%d %d\n",c.first,c.second);
	return 0;
}