#include <bits/stdc++.h>
#define endl "\n"
#define pii pair<int,int>
using namespace std;

int n;
string s;

set<pii> res;
map<pii,int> mp;

inline void dfs(int cur, int x, int y){
	if(cur==n+1){
		res.insert({x,y});
		return ;
	}
	
	if(s[cur]=='L'){
		if(mp.count({x-1,y})){
			if(mp[{x-1,y}]==-1) dfs(cur+1,x,y);
			else dfs(cur+1,x-1,y), dfs(cur+1,x,y);
		}else{
			mp[{x-1,y}] = -1;
			dfs(cur+1,x,y);
			
			mp[{x-1,y}] = 1;
			dfs(cur+1,x,y);
			dfs(cur+1,x-1,y);
		}
	}
	if(s[cur]=='R'){
		if(mp.count({x+1,y})){
			if(mp[{x+1,y}]==-1) dfs(cur+1,x,y);
			else dfs(cur+1,x+1,y), dfs(cur+1,x,y);
		}else{
			mp[{x+1,y}] = -1;
			dfs(cur+1,x,y);
			
			mp[{x+1,y}] = 1;
			dfs(cur+1,x,y);
			dfs(cur+1,x+1,y);
		}
	}
	if(s[cur]=='D'){
		if(mp.count({x,y-1})){
			if(mp[{x,y-1}]==-1) dfs(cur+1,x,y);
			else dfs(cur+1,x,y-1), dfs(cur+1,x,y);
		}else{
			mp[{x,y-1}] = -1;
			dfs(cur+1,x,y);
			
			mp[{x,y-1}] = 1;
			dfs(cur+1,x,y);
			dfs(cur+1,x,y-1);
		}
	}
	if(s[cur]=='U'){
		if(mp.count({x,y+1})){
			if(mp[{x,y+1}]==-1) dfs(cur+1,x,y);
			else dfs(cur+1,x,y+1), dfs(cur+1,x,y);
		}else{
			mp[{x,y+1}] = -1;
			dfs(cur+1,x,y);
			
			mp[{x,y+1}] = 1;
			dfs(cur+1,x,y);
			dfs(cur+1,x,y+1);
		}
	}
}


signed main(){
	mp[{0,0}]=1;
	cin >> n;
	cin >> s;
	s = " " +s;
	dfs(1,0,0);
	cout << res.size() << endl;
	for(auto k:res){
		cout << k.first << " " << k.second << endl;
	}
	
	return 0;
}