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

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

PII d[4] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};
map<char, int> m;

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	m['L'] = 0;
	m['R'] = 1;
	m['D'] = 2;
	m['U'] = 3;
	
	int n;
	cin >> n;
	string s;
	cin >> s;
	set<PII> ans;
	FOR (i, 0, 1 << n)
	{
		set<PII> used;
		set<PII> banned;
		int x = 0, y = 0;
		used.insert({x, y});
		bool ok = true;
		FOR (j, 0, n)
		{
			int nx = x + d[m[s[j]]].F;
			int ny = y + d[m[s[j]]].S;
			if (used.count({nx, ny}) && (i & (1 << j)) == 0)
			{
				ok = false;
				break;
			}
			if (banned.count({nx, ny}) && (i & (1 << j)) != 0)
			{
				ok = false;
				break;				
			}
			if (i & (1 << j))
			{
				x = nx;
				y = ny;
				used.insert({x, y});
			}
			else
				banned.insert({nx, ny});
		}
		if (ok)
			ans.insert({x, y});
	}
	cout << SZ(ans) << '\n';
	for (auto [x, y] : ans)
		cout << x << ' ' << y << '\n';
	
	return 0;
}