#include<bits/stdc++.h>
using namespace std;
using ll=long long;
template<typename T>
ostream& operator << (ostream &out,const vector<T>&x){
	if(x.empty())return out<<"[]";
	out<<'['<<x[0];
	for(int len=x.size(),i=1;i<len;i++)out<<','<<x[i];
	return out<<']';
}
template<typename T>
vector<T> ary(const T *a,int l,int r){
	return vector<T>{a+l,a+1+r};
}
template<typename T>
void debug(T x){
	cerr<<x<<'\n';
}
template<typename T,typename ...S>
void debug(T x,S ...y){
	cerr<<x<<' ',debug(y...);
}
const int N=22;
int n;
char a[N];
vector<pair<int,int> >ban,ans,ok;
bool chk(int x,int y){
	for(auto t:ban){
		if(t.first==x&&t.second==y)return 0;
	}
	return 1;
}
bool find(int x,int y){
	for(auto t:ok){
		if(t.first==x&&t.second==y)return 0;
	}
	return 1;
}
void dfs(int i,int x,int y){
	if(i==n+1){
		return ans.push_back({x,y});
	}
	ok.push_back({x,y});
	if(a[i]=='L'){
		if(!chk(x-1,y)){
			dfs(i+1,x,y);
		}else{
			if(find(x-1,y)){
				ban.push_back({x-1,y});
				dfs(i+1,x,y);
				ban.pop_back();
			}
			dfs(i+1,x-1,y);
		}
	}else if(a[i]=='R'){
		if(!chk(x+1,y)){
			dfs(i+1,x,y);
		}else{
			if(find(x+1,y)){
				ban.push_back({x+1,y});
				dfs(i+1,x,y);
				ban.pop_back();
			}
			dfs(i+1,x+1,y);
		}
	}else if(a[i]=='D'){
		if(!chk(x,y-1)){
			dfs(i+1,x,y);
		}else{
			if(find(x,y-1)){
				ban.push_back({x,y-1});
				dfs(i+1,x,y);
				ban.pop_back();
			}
			dfs(i+1,x,y-1);
		}
	}else if(a[i]=='U'){
		if(!chk(x,y+1)){
			dfs(i+1,x,y);
		}else{
			if(find(x,y+1)){
				ban.push_back({x,y+1});
				dfs(i+1,x,y);
				ban.pop_back();
			}
			dfs(i+1,x,y+1);
		}
	}
	ok.pop_back();
}
int main(){
	scanf("%d%s",&n,a+1);
	dfs(1,0,0);
	sort(ans.begin(),ans.end());
	ans.erase(unique(ans.begin(),ans.end()),ans.end());
	printf("%d\n",(int)ans.size());
	for(auto t:ans)printf("%d %d\n",t.first,t.second);
	return 0;
}