#include <bits/stdc++.h>
using namespace std;

#define all(v) begin(v), end(v)
typedef long long LL;
typedef long long ll;
typedef unsigned long long ULL;
typedef unsigned long long ull;


set<pair<int,int>> vis, blocked;
int n;
string s;
set<pair<int,int>> ans;

#define pii pair<int,int>

void dfs(int x, int y, int i)
{
	if(i == s.size())
	{
		ans.emplace(x,y);
		return;
	}
		// if(i == 2)
		// 	cout << "dbg: " << i << " " << x << " " << y << endl;///////////////////////////////////////
	if(s[i] == 'L')
	{
		if(vis.count(pii{x-1,y}))
			dfs(x-1,y,i+1);
		else if(blocked.count(pii{x-1,y}))
			dfs(x,y,i+1);
		else
		{
			vis.emplace(pii{x-1,y});
			dfs(x-1,y,i+1);
			vis.erase(pii{x-1,y});

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

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

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

			blocked.emplace(pii{x,y-1});
			dfs(x,y,i+1);
			blocked.erase(pii{x,y-1});
		}
	}
}

int main() {
	cin.tie(NULL)->sync_with_stdio(false);

	cin >> n;
	cin >> s;
	vis.emplace(pii{0,0});
	dfs(0,0,0);
	cout << ans.size() << "\n";
	for(auto p: ans)
		cout << p.first << " " << p.second << "\n";

	return 0;
}