#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define data dataa
using LL=long long;
using ULL=unsigned long long;
using LD=long double;
#define gcd(x,y) __gcd(unsigned(x),unsigned(y))
const int dx[4]={-1,1,0,0};
const int dy[4]={0,0,-1,1};
map<pair<int,int>,int>mapp;
set<pair<int,int>>ans;
int a[22],n;
char s[22];
int get(char c)
{
    if(c=='L')return 0;
    else if(c=='R')return 1;
    else if(c=='D')return 2;
    else return 3;
}
void dfs(int x,int y,int k)
{
    if(k>n){ans.insert(mp(x,y));return;}
    int nx=x+dx[a[k]],ny=y+dy[a[k]];
    if(mapp.contains(mp(nx,ny)))
    {
        if(mapp[mp(nx,ny)])dfs(nx,ny,k+1);
        else dfs(x,y,k+1);
        return;
    }
    mapp[mp(nx,ny)]=1;dfs(nx,ny,k+1);
    mapp[mp(nx,ny)]=0;dfs(x,y,k+1);
    mapp.erase(mp(nx,ny));
}
int main()
{
    scanf("%d",&n);
    scanf("%s",s+1);
    rep(i,n)a[i]=get(s[i]);
    mapp[mp(0,0)]=1;
    dfs(0,0,1);
    printf("%d\n",int(ans.size()));
    for(auto [x,y]:ans)printf("%d %d\n",x,y);
    return 0;
}