#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
inline ll read(){
    ll res = 0, f = 1;
    char c = getchar();
    while(c > '9' || c < '0'){
        if(c == '-')f = -1;
        c = getchar();
    }
    while(c >= '0' && c <= '9'){
        res = res * 10 + c - '0';
        c = getchar();
    }
    return res * f;
}
string s;
const int N = 50;
int dirx[40], diry[40];
int st[100][100];
ll n;

struct ii {
    ll x, y;
    bool operator<(const ii & a)const{
        if(x == a. x)return y < a. y;
        return x < a. x;
    }
};

set<ii>ans;
void dfs(ll x, ll y, ll deep){
    if(deep == n + 1){
        ans. insert({x, y});
        return;
    }
    ll ne_x = x + dirx[deep], ne_y = y + diry[deep];
    if(st[N + ne_x][N + ne_y] == 0){

        st[N + ne_x][N + ne_y] = 1;
        dfs(x, y, deep + 1);


        st[N + ne_x][N + ne_y] = 2;
        dfs(ne_x, ne_y, deep + 1);


        st[N + ne_x][N + ne_y] = 0;
    }
    else if(st[N + ne_x][N + ne_y] == 2){
        dfs(ne_x, ne_y, deep + 1);
    }
    else{
        dfs(x, y, deep + 1);
    }
    return;
}

signed main(){
    n = read();
    cin >> s;
    s = ' ' + s;
    for(int i = 1; i <= n; i ++){
        switch(s[i]){
            case 'L':
                dirx[i] = -1, diry[i] = 0;
                break;
            case 'R':
                dirx[i] = 1, diry[i] = 0;
                break;
            case 'U':
                dirx[i] = 0, diry[i] = 1;
                break;
            case 'D':
                dirx[i] = 0, diry[i] = -1;
                break;
        }
    }
    // for(int i = 1; i <= n; i ++){
    //     cout << dirx[i] << ' ' << diry[i] << endl;
    // }
    st[N][N] = 2;
    dfs(0, 0, 1);
    cout << ans. size() << endl;
    for(auto it = ans. begin(); it != ans. end(); it ++){
        ii mid = *it;
        cout << mid. x << ' ' << mid. y << endl;
    }
    return 0;
}