#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;
char s[N];
vector<pii> ans;
map<pii, int> mp;

void dfs(int dep, int x, int y) {
  if (dep > n) {
    ans.emplace_back(x, y);
    return;
  }
  mp[pii(x, y)] = -1;
  int tx = x, ty = y;
  if (s[dep] == 'L') tx--;
  if (s[dep] == 'R') tx++;
  if (s[dep] == 'U') ty++;
  if (s[dep] == 'D') ty--;
  if (mp[pii(tx, ty)] == 0) {
    mp[pii(tx, ty)] = 1, dfs(dep + 1, x, y), mp[pii(tx, ty)] = 0;
    mp[pii(tx, ty)] = -1, dfs(dep + 1, tx, ty), mp[pii(tx, ty)] = 0;
  } else if (mp[pii(tx, ty)] == -1) {
    dfs(dep + 1, tx, ty);
  } else if (mp[pii(tx, ty)] == 1) {
    dfs(dep + 1, x, y);
  }
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> (s + 1);
  dfs(1, 0, 0);
  sort(ALL(ans)), ans.erase(unique(ALL(ans)), ans.end());
  cout << SZ(ans) << "\n";
  for (auto [x, y] : ans) cout << x << " " << y << "\n";
}