#include <bits/stdc++.h>

using namespace std;

#define all(V) V.begin (), V.end ()

using LL = long long;


vector<pair<int, int>> ans;

map<char, pair<int, int>> dir;
void calc(int id, int i, int j, string &inc, int n, map<pair<int, int>, int> mp){
	if(id >= n){
		// cerr<<"Ends here ";
		// cerr<<i<<" "<<j<<'\n';
		// for(auto [i, j]: mp){
		// 	cerr<<i.first<<" "<<i.second<<" "<<j<<'\n';
		// }
		ans.push_back({i, j}); return;
	}
	auto [x, y] = dir[inc[id]];
	if(!mp.count ({i + x, j + y})){
		mp[{i + x, j + y}] = 2;
		calc(id + 1, i + x, j + y, inc, n, mp);

		mp[{i + x, j + y}] = 1;
		calc(id + 1, i, j, inc, n, mp);
		mp.erase ({i + x, j + y});
	}else if(mp.count ({i + x, j + y}) and mp[{i + x, j + y}] == 1){
		calc(id + 1, i, j, inc, n, mp);
	}else if (mp.count ({i + x, j + y}) and mp[{i + x, j + y}] == 2){
		calc(id + 1, i + x, j + y, inc, n, mp);
	}
}

void solve (int tc) {
	dir['L'] = {-1, 0};
	dir['R'] = {1, 0};
	dir['U'] = {0, 1};
	dir['D'] = {0, -1};

	int n; cin>>n;
	string s; cin>>s;
	map<pair<int, int>, int> mp; mp[{0, 0}] = 2;
	calc(0, 0, 0, s, n, mp);
	sort(all(ans));
	ans.erase(unique(all(ans)), ans.end());
	cout<<ans.size()<<'\n';
	for(auto &[i, j]: ans){
		cout<<i<<" "<<j<<'\n';
	}
}

int main () {
	cin.tie (nullptr) -> ios_base :: sync_with_stdio (false);
	int tests = 1;
	// cin >> tests;
	for (int tc = 1; tc <= tests; tc++) {
		solve (tc);
	}
	return 0;
}