#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ " = "), debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

using namespace std;

const int N = 21;

int n;
string s;
map<pii, int> mp, ans;

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> s;
  rep (mask, 0, (1 << n) - 1) {
    mp.clear();
    int x = 0, y = 0, ok = 1;
    rep (i, 0, n - 1) {
      int tx = x, ty = y;
      if (s[i] == 'L') tx--;
      if (s[i] == 'R') tx++;
      if (s[i] == 'D') ty--;
      if (s[i] == 'U') ty++;
      if (mask >> i & 1) {
        x = tx, y = ty;
      } else {
        mp[pii(tx, ty)] = 1;
      }
    }
    x = 0, y = 0;
    if (mp.count(pii(0, 0))) continue;
    rep (i, 0, n - 1) {
      int tx = x, ty = y;
      if (s[i] == 'L') tx--;
      if (s[i] == 'R') tx++;
      if (s[i] == 'D') ty--;
      if (s[i] == 'U') ty++;
      if (mask >> i & 1) {
        if (mp.count(pii(tx, ty))) ok = 0;
        x = tx, y = ty;
      }
    }
    if (ok) ans[pii(x, y)] = 1;
  }
  cout << SZ(ans) << "\n";
  for (auto [x, y] : ans) cout << x.fi << " " << x.se << "\n";
}