#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)

void solve(){
	int n;
	cin>>n;
	string s;
	cin>>s;
	vector<pair<int,int>>occ;
	vector<pair<int,int>>empt;
	set<pair<int,int> >ans;
	rep(msk,0,(1<<n)){
		occ.clear();empt.clear();
		int x=0;
		int y=0;
		empt.push_back({0,0});
		rep(i,0,n){
			int newx=x;
			int newy=y;
			if(s[i]=='L'){
				newx--;
			}
			if(s[i]=='R'){
				newx++;
			}
			if(s[i]=='U'){
				newy++;
			}
			if(s[i]=='D'){
				newy--;
			}
			if(msk&(1<<i)){
				occ.push_back({newx,newy});
			}else{
				empt.push_back({newx,newy});
				x=newx;
				y=newy;
			}
		}
		bool cont=false;
		trav(a,occ){
			trav(b,empt){
				if(a==b)cont=true;
			}
		}
		if(!cont)ans.insert({x,y});
	}
	cout<<ans.size()<<"\n";
	trav(a,ans)cout<<a.first<<" "<<a.second<<"\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	//cin>>tt;
	while(tt--){
		solve();
	}
}