#include <bits/stdc++.h>

#define pii pair<int, int>

using namespace std;

set <pii> ans, vis, blk;
int n;
string s;

void dfs(int x, int y, int i)
{
	if(i == n)
	{
		ans.insert({x, y});
		return;
	}
	if(s[i] == 'R')
	{
		if(vis.count((pii){x+1, y}))
			dfs(x+1, y, i+1);
		else if(blk.count((pii){x+1, y}))
			dfs(x, y, i+1);
		else
		{
			vis.insert({x+1, y});
			dfs(x+1, y, i+1);
			vis.erase({x+1, y});

			blk.insert({x+1, y});
			dfs(x, y, i+1);
			blk.erase({x+1, y});
		}
	}
	if(s[i] == 'L')
	{

		if(vis.count((pii){x-1, y}))
			dfs(x-1, y, i+1);
		else if(blk.count((pii){x-1, y}))
			dfs(x, y, i+1);
		else
		{
			vis.insert({x-1, y});
			dfs(x-1, y, i+1);
			vis.erase({x-1, y});

			blk.insert({x-1, y});
			dfs(x, y, i+1);
			blk.erase({x-1, y});
		}
	}
	if(s[i] == 'U')
	{
		if(vis.count((pii){x, y+1}))
			dfs(x, y+1, i+1);
		else if(blk.count((pii){x, y+1}))
			dfs(x, y, i+1);
		else
		{
			vis.insert({x, y+1});
			dfs(x, y+1, i+1);
			vis.erase({x, y+1});

			blk.insert({x, y+1});
			dfs(x, y, i+1);
			blk.erase({x, y+1});
		}
	}
	if(s[i] == 'D')
	{
		if(vis.count((pii){x, y-1}))
			dfs(x, y-1, i+1);
		else if(blk.count((pii){x, y-1}))
			dfs(x, y, i+1);
		else
		{
			vis.insert({x, y-1});
			dfs(x, y-1, i+1);
			vis.erase({x, y-1});

			blk.insert({x, y-1});
			dfs(x, y, i+1);
			blk.erase({x, y-1});
		}
	}
}

int main()
{
	cin >> n >> s;
	vis.insert({0, 0});
	dfs(0, 0, 0);
	cout << ans.size() << "\n";
	for(auto [x, y] : ans)
		cout << x << " " << y << "\n";
	return 0;
}