#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5+100;
const int INF = 1e18;
int n;
string s; 
set<pair<int,int>> v,e;

void dfs(int i,int x,int y){
    if(i==n) {
        v.insert({x,y}); //cout<<i<<": "<<x<<" "<<y<<endl;
        return;
    }
    int tx=0,ty=0;
    if(s[i]=='L') tx--;
    if(s[i]=='R') tx++;
    if(s[i]=='D') ty--;
    if(s[i]=='U') ty++;
    //cout<<i<<": ";
    //for(auto [u,v]:e) cout<<u<<' '<<v<<','; cout<<endl;

    if(e.count({x+tx,y+ty})) {
        dfs(i+1,x+tx,y+ty);
    }
    else {
        e.insert({x+tx,y+ty});
        dfs(i+1,x+tx,y+ty);
        e.erase({x+tx,y+ty});
        dfs(i+1,x,y);
    }
}

signed main()
{
    std::ios::sync_with_stdio(false);
	std::cin.tie(0);
     
    cin>>n>>s;
    e.insert({0,0});
    dfs(0,0,0);
    cout<<v.size()<<endl;
    for(auto [x,y]:v) cout<<x<<' '<<y<<endl;
    return 0;
}