#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define all(p) p.begin(),p.end()

int main(){
    int N;
    cin>>N;
    string S;
    cin>>S;
    vector<int> dx,dy;
    rep(i,0,N){
        if(S[i]=='L') dx.push_back(-1),dy.push_back(0);
        if(S[i]=='R') dx.push_back(1),dy.push_back(0);
        if(S[i]=='D') dx.push_back(0),dy.push_back(-1);
        if(S[i]=='U') dx.push_back(0),dy.push_back(1);
    }
    vector<pair<int,int>> ans;
    int M=22;
    vector<vector<int>> p(M*2,vector<int>(M*2,-1));
    rep(i,0,1<<N){
        int x=M,y=M;
        p[x][y]=0;
        vector<pair<int,int>> q(N);
        bool ok=1;
        rep(j,0,N){
            int n_x=x+dx[j],n_y=y+dy[j];
            int tmp=0;
            if(i&(1<<j)) tmp=1;
            if(p[n_x][n_y]==1&&tmp==1) ok=0;
            if(p[n_x][n_y]==0&&tmp==0) ok=0;
            if(tmp==0) p[n_x][n_y]=1;
            else p[n_x][n_y]=0,x=n_x,y=n_y;
            q[j]={n_x,n_y};
        }
        if(ok) ans.push_back({x-M,y-M});
        for(auto z:q) p[z.first][z.second]=-1;
    }
    sort(all(ans));
    vector<pair<int,int>> n_ans;
    rep(i,0,ans.size()){
        if(i!=0&&ans[i-1]==ans[i]) continue;
        n_ans.push_back(ans[i]);
    }
    cout<<n_ans.size()<<"\n";
    for(auto z:n_ans) cout<<z.first<<" "<<z.second<<"\n";
}