#include<bits/stdc++.h>
using namespace std;

pair<int,int> check(int mask,string s){
    
    int x=0,y=0;
    
    map<pair<int,int>,bool> ok;
    for(int i=0;i<s.size();i++){
        int sx=x,sy=y;
        if(s[i]=='L')sx--;
        else if(s[i]=='R')sx++;
        else if(s[i]=='D')sy--;
        else sy++;
        
        if(mask&(1<<i)){
            ok[{sx,sy}]=true;
        }else{
            if(ok[{sx,sy}])return {0,0};
            x=sx;
            y=sy;
        }
    }
    
    if(ok[{0,0}])return {0,0};
    
    x=0,y=0;
    for(int i=0;i<s.size();i++){
        int sx=x,sy=y;
        if(s[i]=='L')sx--;
        else if(s[i]=='R')sx++;
        else if(s[i]=='D')sy--;
        else sy++;
        
        if(mask&(1<<i)){
            continue;
        }else{
            if(ok[{sx,sy}])return {0,0};
            x=sx;
            y=sy;
        }
    }
    
    return {x,y};
}

void solve(int t){
    int n;
    cin>>n;
    
    string s;
    cin>>s;
    
    set<pair<int,int>> ds;
    for(int i=0;i<(1<<n);i++){
        ds.insert(check(i,s));
    }
    
    cout<<ds.size()<<"\n";
    for(auto [x,y] : ds){
        cout<<x<<" "<<y<<"\n";
    }
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int t=1;
    //cin>>t;
    for(int i=1;i<=t;i++)solve(i);
    
    return 0;
}