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

#define mk make_pair
#define lob lower_bound
#define upb upper_bound
#define fi first
#define se second
#define SZ(x) ((int)(x).size())

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;

template<typename T> inline void ckmax(T& x, T y) { x = (y > x ? y : x); }
template<typename T> inline void ckmin(T& x, T y) { x = (y < x ? y : x); }

int n;
string s;
vector<pii> ans;
int x, y;
pii nxt(char c) {
	if (c == 'L') {
		return mk(x - 1, y);
	} else if (c == 'R') {
		return mk(x + 1, y);
	} else if (c == 'D') {
		return mk(x, y - 1);
	} else {
		return mk(x, y + 1);
	}
}

void check(int i) {
	map<pii, int> obs;
	obs[mk(0, 0)] = -1;
	
	x = 0; y = 0;
	
	for (int j = 0; j < n; ++j) {
		if ((i >> j) & 1) { // meets an obs
			int xx = nxt(s[j]).fi;
			int yy = nxt(s[j]).se;
			
			if (obs[mk(xx, yy)] == -1) {
				return;
			}
			obs[mk(xx, yy)] = 1;
		} else {
			x = nxt(s[j]).fi;
			y = nxt(s[j]).se;
			
			if (obs[mk(x, y)] == 1) {
				return;
			}
			obs[mk(x, y)] = -1;
		}
	}
	
	ans.push_back(mk(x, y));
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	
	cin >> n;
	cin >> s;
	
	for (int i = 0; i < (1 << n); ++i) {
		check(i);
	}
	sort(ans.begin(), ans.end());
	ans.erase(unique(ans.begin(), ans.end()), ans.end());
	cout << ans.size() << endl;
	for (int i = 0; i < SZ(ans); ++i) {
		cout << ans[i].fi << " " << ans[i].se << endl;
	}
	return 0;
}