#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> Pr;
#define fi first
#define se second
#define mkp make_pair
#define pb emplace_back
// #define mid ((l+r)>>1)
#define popcnt __builtin_popcountll
const ll mod = 998244353;
inline ll read(){
	ll x=0, f=1; char ch=getchar();
	while(ch<'0' || ch>'9') { if(ch=='-') f=-1; ch=getchar(); }
	while(ch>='0' && ch<='9') x=x*10+ch-'0', ch=getchar();
	return x*f;
}
inline ll lg2(ll x){ return 63^__builtin_clzll(x); }
inline ll qpow(ll a,ll b){
	ll ans=1, base=a;
	while(b){
		if(b&1) ans=ans*base%mod;
		base=base*base%mod; b>>=1;
	}
	return ans;
}
void init(){ }
ll n; char s[25];
int vis[41][41], pos[41][41];
void procedure(){
	n=read();
	scanf("%s", s);
	for(int S=0;S<(1<<n);S++){
		memset(vis,-1,sizeof(vis));
		int x=20, y=20; vis[x][y]=0;
		bool flg=1;
		for(int i=0;i<n;i++){
			if(s[i]=='L') x--;
			if(s[i]=='R') x++;
			if(s[i]=='D') y--;
			if(s[i]=='U') y++;
			if((S>>i)&1){
				if(vis[x][y]==1) {
					flg=0;
					break;
				}
				vis[x][y]=0;
			}else{
				if(vis[x][y]==0) {
					flg=0;
					break;
				}
				vis[x][y]=1;
				if(s[i]=='R') x--;
				if(s[i]=='L') x++;
				if(s[i]=='U') y--;
				if(s[i]=='D') y++;
			}
		}
		if(flg) pos[x][y]=1;

		// cout<<"solved "<<S<<endl;
	}
	vector<Pr>v;
	for(int x=0;x<=40;x++){
		for(int y=0;y<=40;y++){
			if(pos[x][y]) v.pb(x-20, y-20);
		}
	}
	printf("%lld\n", (ll)v.size());
	for(auto p: v) printf("%lld %lld\n", p.fi, p.se);
}
int main(){
	#ifdef LOCAL
		assert(freopen("input.txt","r",stdin));
		assert(freopen("output.txt","w",stdout));
	#endif
	ll T=1;
	init();
	while(T--) procedure();
	return 0;
}