//#define dxx
#ifdef dxx
#define dbg(...) fprintf(stderr,__VA_ARGS__)
#define dex(a) dbg(#a"=%lld onL%d infun %s\n",a,__LINE__,__FUNCTION__)
#include<cstdlib>
#define pause sys##tem("pause")
#define _GLIBCXX_DEBUG
#endif

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<set>

using ll=long long;
using std::max;
using std::min;
using std::abs;
template<class T> void cmax(T&a,T b){a=max(a,b);}
template<class T> void cmin(T&a,T b){a=min(a,b);}
template<class T> T sqr(T a){return a*a;}

namespace xm{
    const int ZERO=22;
    std::set<std::pair<int,int> > st;
    int N;
    char seq[50];
    short vis[50][50];
    void dfs(int x,int y,int si){
        int dx,dy,nx,ny;
        if(si>N){
            st.emplace(x,y);
            return;
        }
        vis[x+ZERO][y+ZERO]=1;
        if(seq[si]=='L') dx=-1,dy=0;
        if(seq[si]=='R') dx=1,dy=0;
        if(seq[si]=='U') dx=0,dy=1;
        if(seq[si]=='D') dx=0,dy=-1;
        nx=x+dx;
        ny=y+dy;
        if(vis[nx+ZERO][ny+ZERO]==1){
            dfs(nx,ny,si+1);
        }else if(!vis[nx+ZERO][ny+ZERO]){
            vis[nx+ZERO][ny+ZERO]=-1;
            dfs(x,y,si+1);
            dfs(nx,ny,si+1);
            vis[nx+ZERO][ny+ZERO]=0;
        }else{
            dfs(x,y,si+1);
        }
    }void _(){
        scanf("%d%s",&N,seq+1);
        dfs(0,0,1);

        printf("%zu\n",st.size());
        for(auto pair:st) printf("%d %d\n",pair.first,pair.second);
    }
}

int main(){
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    xm::_();
    return 0;
}