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

using ll = long long;

constexpr int maxn = 50;
int n;
char ro[maxn];
int dx[maxn], dy[maxn];
vector<pair<int, int>> res;
bool vis[50][50];

void check(int s) {
  // cerr << s << ": \n";
  int x = 25, y = 25;
  for (int i = 0; i < n; ++i) {
    if (s >> i & 1) {
      x += dx[i], y += dy[i];
    } else {
      // cerr << "ban " << x + dx[i] << ' ' << y + dy[i] << '\n';
      vis[x + dx[i]][y + dy[i]] = 1;
    }
  }
  x = y = 25;
  bool flag = true;
  if (vis[x][y]) flag = false;
  for (int i = 0; i < n && flag; ++i) {
    if (s >> i & 1) {
      x += dx[i], y += dy[i];
      // cerr << "go " << x << ' ' << y << '\n';
      if (vis[x][y]) {
        flag = false;
      }
    }
  }
  if (flag) res.emplace_back(x - 25, y - 25);
  x = y = 25;
  for (int i = 0; i < n; ++i) {
    if (s >> i & 1) {
      x += dx[i], y += dy[i];
    } else {
      vis[x + dx[i]][y + dy[i]] = 0;
    }
  }
}

int main() {
#ifndef LOCAL
  cin.tie(nullptr)->sync_with_stdio(false);
#endif
  scanf("%d%s", &n, ro);
  for (int i = 0; i < n; ++i) {
    if (ro[i] == 'L') dx[i] = -1;
    if (ro[i] == 'R') dx[i] = 1;
    if (ro[i] == 'U') dy[i] = 1;
    if (ro[i] == 'D') dy[i] = -1;
  }
  int m = 1 << n;
  for (int i = 0; i < m; ++i) {
    check(i);
  }
  sort(res.begin(), res.end());
  res.erase(unique(res.begin(), res.end()), res.end());
  printf("%d\n", res.size());
  for (auto e : res) printf("%d %d\n", e.first, e.second);
}