#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

int n ;
string a ;
set < pii > ans ;
vector < pii > all , bad ;

void dfs ( int i , int x , int y ) {
    if ( i == n ) {
        ans.insert ( { x , y } ) ;
        return ;
    }
    int nx = x , ny = y ;
    if ( a[ i ] == 'L' ) { -- nx ; }
    else if ( a[ i ] == 'R' ) { ++ nx ; }
    else if ( a[ i ] == 'D' ) { -- ny ; }
    else { ++ ny ; }
    bool emp = false , full = false ;
    for ( auto hh : all ) {
        if ( hh.fi == nx && hh.se == ny ) {
            emp = true ;
            break ;
        }
    }
    for ( auto hh : bad ) {
        if ( hh.fi == nx && hh.se == ny ) {
            full = true ;
            break ;
        }
    }
    if ( full != true ) {
        all.push_back ( { nx , ny } ) ;
        dfs ( i + 1 , nx , ny ) ;
        all.pop_back ( ) ;
    }
    if ( emp != true ) {
        bad.push_back ( { nx , ny } ) ;
        dfs ( i + 1 , x , y  ) ;
        bad.pop_back ( ) ;
    }
}

void solve ( ) {
    cin >> n >> a ;
    all.push_back ( { 0 , 0 } ) ;
    dfs ( 0 , 0 , 0 ) ;
    int sz = ans.size ( ) ;
    cout << sz << "\n" ;
    for ( auto [ x , y ] : ans ) {
        cout << x << " " << y << "\n" ;
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}