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

void dfs(int i,int x,int y){
    if(i==n) {
        v.push_back({x,y});
        return;
    }
    if(s[i]=='L') {
        if(x>0) dfs(i+1,x-1,y);
        else dfs(i+1,x-1,y),dfs(i+1,x,y); 
    }
    if(s[i]=='R') {
        if(x<0) dfs(i+1,x+1,y);
        else dfs(i+1,x+1,y),dfs(i+1,x,y);
    }
    if(s[i]=='D') {
        if(y>0) dfs(i+1,x,y-1);
        else dfs(i+1,x,y-1),dfs(i+1,x,y);
    }
    if(s[i]=='U') {
        if(y<0) dfs(i+1,x,y+1);
        else dfs(i+1,x,y+1),dfs(i+1,x,y);
    }
}

signed main()
{
    std::ios::sync_with_stdio(false);
	std::cin.tie(0);
     
    cin>>n>>s;
    dfs(0,0,0);
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
    cout<<v.size()<<endl;

    for(auto [x,y]:v) cout<<x<<' '<<y<<endl;
    return 0;
}