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

#define ll long long

void solve(){
	int n;
	string s;
	cin>>n>>s;
	set<pair<int,int>>st;
	map<char,int>mp = {{'L', 0}, {'R', 1}, {'U', 2}, {'D', 3}};
	int nx[4][2] = {{-1, 0}, {1, 0}, {0, 1}, {0, -1}};
	
	for(int i=0;i<(1<<n);i++){
		int x = 0,y = 0;
		map<pair<int,int>, int>vis;//1不能走，2走过 
		bool f = 1;
		vis[{0, 0}] = 2;
		for(int j=0;j<n;j++){
			if(i >> j & 1){
				int dx = x + nx[mp[s[j]]][0];
				int dy = y + nx[mp[s[j]]][1]; 
				if(vis[{dx,dy}] != 1){
					x = dx;
					y = dy;
				}
			}
			else {
				int dx = x + nx[mp[s[j]]][0];
				int dy = y + nx[mp[s[j]]][1]; 
				if(vis[{dx, dy}] == 2){
					f = 0;
					break;
				} 
				vis[{dx, dy}] = 1;
//				cout<<"i = "<<i<<endl;
//				cout<<"j = "<<j<<" dx = "<<dx<<" dy = "<<dy<<endl;
			}
			vis[{x, y}] = 2;
		}
		if(f){
//			if(x == -1 && y == 0){
//				cout<<"i = "<<i<<endl;
//				for(auto &t:vis){
//				cout<<"x = "<<t.first.first<<" y = "<<t.first.second<<" mp = "<<t.second<<endl;
//			}
//			}
			st.insert({x, y});
		}
	}
	cout<<st.size()<<endl;
	for(auto &t:st)cout<<t.first<<" "<<t.second<<endl;
}

int main(){
	ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
    
    int t = 1;
//    cin>>t;
    
    for(int i=1;i<=t;i++)solve();
    
	return 0;
}