#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int DX[4] = {+1, 0, -1, 0};
constexpr int DY[4] = {0, +1, 0, -1};

constexpr int Z = 50;

int N;
char S[110];

vector<int> H;

// 1: emp, 2: wall
int f[110][110];
bool can[110][110];

void dfs(int i, int x, int y) {
  if (i == N) {
    can[x][y] = true;
  } else {
    const int f0 = f[x][y];
    f[x][y] = 1;
    
    const int xx = x + DX[H[i]];
    const int yy = y + DY[H[i]];
    const int f1 = f[xx][yy];
    // wall
    if (f1 != 1) {
      f[xx][yy] = 2;
      dfs(i + 1, x, y);
      f[xx][yy] = f1;
    }
    // go
    if (f1 != 2) {
      f[xx][yy] = 1;
      dfs(i + 1, xx, yy);
      f[xx][yy] = f1;
    }
    
    f[x][y] = f0;
  }
}

int main() {
  for (; ~scanf("%d", &N); ) {
    scanf("%s", S);
    
    H.resize(N);
    for (int i = 0; i < N; ++i) {
      H[i] = string("RULD").find(S[i]);
    }
    
    memset(f, 0, sizeof(f));
    memset(can, 0, sizeof(can));
    dfs(0, Z, Z);
    
    vector<pair<int, int>> ans;
    for (int x = -N; x <= +N; ++x) for (int y = -N; y <= +N; ++y) {
      if (can[Z + x][Z + y]) {
        ans.emplace_back(x, y);
      }
    }
    printf("%d\n", (int)ans.size());
    for (const auto &xy : ans) {
      printf("%d %d\n", xy.first, xy.second);
    }
  }
  return 0;
}