#include <bits/stdc++.h>

using namespace std;

int n;
string s;

map<pair<int, int>, int> mp;
multiset<pair<int, int>> vis;
multiset<pair<int, int>> block;

void go(int i, int j, int idx){
    
    if(idx == n){	
		mp[{i, j}] = 1;
		return;
    }
    
	pair<int, int> nxt;
    if(s[idx] == 'U') nxt = {i, j+1};
    else if(s[idx] == 'D') nxt = {i, j-1};
    else if(s[idx] == 'R') nxt = {i+1, j};
    else nxt = {i-1, j};
	
    if(vis.find(nxt) == vis.end()){
        block.insert(nxt);
        go(i, j, idx+1);
        block.erase(block.find(nxt));
    }
    if(block.find(nxt) == block.end()){
        vis.insert(nxt);
        go(nxt.first, nxt.second, idx+1);
        vis.erase(vis.find(nxt));
    } else {
        assert(nxt != make_pair(0, 0));
    }
}

int main()
{

    cin >> n >> s;

    vis.insert({0, 0});
    go(0, 0, 0);

    cout << (int)mp.size() << "\n";

    for(auto [f, s] : mp) cout << f.first << " " << f.second << "\n";

    return 0;
}