#include<bits/stdc++.h>
using namespace std;
const int N = 1010;
const int M = 1e5 + 10;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int>PII;
ll n, m;
bool st[N][N];
char g[N][N];
int dx[] = { 1,-1,0,0 };
int dy[] = { 0,0,1,-1 };
ll cnt;
string s;
set<PII>se;
map<PII, int>q;
void dfs(int x, int y, int cnt)
{
    if (cnt == n)
    {
        se.insert({ x,y });
        return;
    }
    int dx = 0, dy = 0;
    if (s[cnt] == 'L')dx--;
    else if (s[cnt] == 'R')dx++;
    else if (s[cnt] == 'U')dy++;
    else dy--;
    if (q[{x + dx, y + dy}] == 0)
    {
        q[{x + dx, y + dy}] = 1;
        dfs(x + dx, y + dy, cnt + 1);
        q[{x + dx, y + dy}] = -1;
        dfs(x, y, cnt + 1);
        q[{x + dx, y + dy}] = 0;
    }
    else if (q[{x + dx, y + dy}] == 1)
    {
        dfs(x + dx, y + dy, cnt + 1);
    }

    else
    {
        dfs(x, y, cnt + 1);
    }
    return;
}

void solve()
{
    cin >> n;
    cin >> s;
    q[{0, 0}] = 1;
    dfs(0, 0, 0);
    cout << se.size() << endl;
    for (auto u : se)
    {
        cout << u.first << " " << u.second << endl;
    }

    return;
}
int main()
{
    ios::sync_with_stdio(0), cin.tie(0);
    ll T = 1;
    // cin >> T;
    while (T--)solve();
    return 0;
}