#include<bits/stdc++.h>
using namespace std;
int n;
string s;
map<array<int,3>,int> mp;
vector<pair<int,int>> ans;
void dfs(int x,int y,int now)
{
	if(mp.count({x,y,now})) return;
	if(now==n+1) 
	{
		ans.push_back({x,y});
		return;
	}
	mp[{x,y,now}]=1;
	dfs(x,y,now+1);
	if(s[now]=='L')
	{
		dfs(x-1,y,now+1);
	}
	else if(s[now]=='R')
	{
		dfs(x+1,y,now+1);
	}
	else if(s[now]=='U') 
	{
		dfs(x,y+1,now+1);
	}
	else if(s[now]=='D')
	{
		dfs(x,y-1,now+1);
	}
}
void solve()
{
	cin>>n>>s;
	s="#"+s;
	dfs(0,0,1); 
	sort(ans.begin(),ans.end(),[&](auto u,auto j)
	{
	    if(u.first==u.second) return u.second<j.second;
		else return u.first<j.second;	
	});
	cout<<ans.size()<<'\n';
	for(auto [i,j]:ans) 
	{
		cout<<i<<" "<<j<<"\n";
	}
}
int main()
{
	ios::sync_with_stdio(0),cin.tie(0);
	solve();
	return 0; 
}