#include <bits/stdc++.h>
//#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#define x first
#define y second
#define endl '\n'
#define pi acos(-1.0)
using namespace std;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<PII, int> PIII;
typedef pair<PII, char> PIIC;
typedef long long LL;
int dx[] = {1, 0, 0, -1, -1, -1, 1, 1}, dy[] = {0, -1, 1, 0, -1, 1, -1, 1};
int mou[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int N = 1e6 + 10, M = 110, mod = 998244353, INF = 0x3f3f3f3f;
const double eps = 1e-8;
int n,m,t;
string str;
set<PII>s;

void dfs(int u,int x,int y)
{
    if(u==n)
    {
        s.insert({x,y});
        return;
    }
    char t=str[u];
    if(t=='L')
    {
        dfs(u+1,x-1,y);
        if(u==0||u&&str[u-1]!='R') dfs(u+1,x,y);
    }
    else if(t=='R')
    {
        dfs(u+1,x+1,y);
        if(u==0||u&&str[u-1]!='L') dfs(u+1,x,y);
    }
    else if(t=='U')
    {
        dfs(u+1,x,y+1);
        if(u==0||u&&str[u-1]!='D') dfs(u+1,x,y);
    }
    else 
    {
        dfs(u+1,x,y-1);
        if(u==0||u&&str[u-1]!='U') dfs(u+1,x,y);
    }
}

void solve()
{
    
    cin>>n>>str;
    dfs(0,0,0);
    cout<<s.size()<<endl;
    for(auto it:s) cout<<it.x<<" "<<it.y<<endl;
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0),cout.precision(10);
    // freopen("in.in","r",stdin);
    // freopen("test.out","w",stdout);  
    t=1; // cin >> t;
    while (t--) solve();
    return 0;
}