#include<bits/stdc++.h>
using namespace std;
map<pair<int,int>,int>ans_vis,path_vis;
vector<pair<int,int>>ans;
string s;

bool cmp(pair<int,int>a,pair<int,int>b){
	if(a.first == b.first){
		return a.second < b.second;
	}
	return a.first < b.first;
}

void dfs(pair<int,int>pre,int id){
	if(id >= (int)s.length()){
		if(!ans_vis[pre]){
			ans_vis[pre] = 1;
			ans.push_back(pre);
		}
		return;
	}
	pair<int,int>now = pre;
	switch (s[id]) {  
		case 'U' : {
			now.second++;
			break;
		}
		case 'D' : {
			now.second--;
			break;
		}
		case 'L' : {
			now.first--;
			break;
		}
		case 'R' : {
			now.first++;
			break;
		}
	}
	if(path_vis[now] == 1){
		dfs(now,id + 1);
	}
	else if(path_vis[now] == 0){
		path_vis[now] = -1;
		dfs(pre,id + 1);
		path_vis[now] = 1;
		dfs(now,id + 1);
		path_vis[now] = 0;
	}
	else{
		dfs(pre,id + 1);
	}
}

signed main(){
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int n = 0;
	cin >> n;
	cin >> s;
	path_vis[{0,0}] = true;
	dfs({0,0},0);
	sort(ans.begin(),ans.end(),cmp);
	cout << ans.size() << endl;
	for(auto it : ans){
		cout << it.first << ' ' << it.second << endl;
	}
	return 0;
}