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

#define sz(a) (int) (a.size())
#define fi first
#define se second
#define ll long long

char cc[4] = {'L', 'R', 'U', 'D'};
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, 1, -1};
        vector < pair <int, int> > tam;
        int c[25];
        bool obstacle[1005][1005];
        set < pair <int, int> > s;

int main() {
    ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n;
    cin >> n;
    for(int i = 0; i < n; ++i) {
        char x; cin >> x;
        for(int j = 0; j < 4; ++j) {
            if(cc[j] == x) c[i] = j;
        }
    }
    for(int mask = 0; mask < (1 << n); ++mask) {
        int posx = 0, posy = 0;
        bool ok = 1;
        for(int j = 0; j < n; ++j) {
            int tmpx = posx + dx[c[j]], tmpy = posy + dy[c[j]];
            if(mask & (1 << j)) {
                obstacle[tmpx + 100][tmpy + 100] = 1;
                tam.push_back({tmpx + 100, tmpy + 100});
            }
            else {
                posx = tmpx;
                posy = tmpy;
            }
        }
        if(obstacle[100][100]) {ok = 0;}
        posx = 0; posy = 0;
        for(int j = 0; j < n; ++j) {
            int tmpx = posx + dx[c[j]], tmpy = posy + dy[c[j]];
            if(!(mask & (1 << j)) && obstacle[tmpx + 100][tmpy + 100]) {
                ok = 0;
                break;
            }
            if(!(mask & (1 << j))) {
                posx = tmpx;
                posy = tmpy;
            }
        }
        while(!tam.empty()) {
            obstacle[tam.back().fi][tam.back().se] = 0;
            tam.pop_back();
        }
        if(!ok) continue;
        s.insert({posx, posy});
    }
    cout << sz(s) << '\n';
    for(auto [x, y]: s) {
        cout << x << " " << y << '\n';
    }

    return 0;
}