#include<bits/stdc++.h>

using namespace std;

#define ff first
#define ss second
#define mp make_pair
#define pb push_back

typedef long long ll;
typedef double lf;
typedef pair<int,int> pii;

const int N = (int) 105;


int n;
string str;

char dir[] = {'L', 'R', 'D', 'U'};
int dX[] = {-1, 1, 0, 0};
int dY[] = {0, 0, -1, 1};

int obst[N][N], passed[N][N];
set <pii> finish;

void check ( int mask, int c_x = 50, int c_y = 50, int ind = 0 ) {
	if ( ind == n ) {
		finish.insert ( {c_x-50, c_y-50} );
		return;
	}
	passed[c_x][c_y]++;
	int n_x = c_x, n_y = c_y, it = find ( dir, dir+4, str[ind] ) - dir;
	n_x += dX[it], n_y += dY[it];
	if ( (mask>>ind) & 1 and passed[n_x][n_y] == 0 ) {
		obst[n_x][n_y]++;
		check ( mask, c_x, c_y, ind+1 );
		obst[n_x][n_y]--;
	} else if ( !((mask>>ind) & 1) and obst[n_x][n_y] == 0 ) {
		check ( mask, n_x, n_y, ind+1 );
	}
	passed[c_x][c_y]--;
}

int main()
{
	cin.tie( NULL );
	ios_base::sync_with_stdio( 0 );

	#ifdef LOCAL
		freopen("input.txt", "r", stdin );
	#else
		#define endl '\n'
	#endif

	cin >> n;
	cin >> str;
	
	for ( int mask = 0; mask < (1<<n); ++mask ) {
		check ( mask );
	}
	
	cout << finish.size() << "\n";
	for ( pii it: finish ) {
		cout << it.ff << " " << it.ss << "\n";
	}

	return 0;
}