#include<bits/stdc++.h>
using namespace std;
int n,ban[105][105];vector<pair<int,int> >ans;char s[25];
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin>>n>>s;
    for(int i=0;i<(1<<n);i++)
    {
    	int x=0,y=0;
    	for(int j=0;j<n;j++)
    	{
    		int nx=x,ny=y;
    		if(s[j]=='L')nx--;
			if(s[j]=='R')nx++;
			if(s[j]=='U')ny++;
			if(s[j]=='D')ny--;
    		if(i&(1<<j))x=nx,y=ny;
			else ban[nx+20][ny+20]=1;
		}
		x=0;y=0;int flag=1;
		for(int j=0;j<n;j++)
		{
			int nx=x,ny=y;
			if(ban[x+20][y+20])flag=0;
    		if(s[j]=='L')nx--;
			if(s[j]=='R')nx++;
			if(s[j]=='U')ny++;
			if(s[j]=='D')ny--;
    		if(i&(1<<j))x=nx,y=ny;
		}
		if(ban[x][y])flag=0;
		x=0;y=0;
		for(int j=0;j<n;j++)
    	{
    		int nx=x,ny=y;
    		if(s[j]=='L')nx--;
			if(s[j]=='R')nx++;
			if(s[j]=='U')ny++;
			if(s[j]=='D')ny--;
    		if(i&(1<<j))x=nx,y=ny;
			else ban[nx+20][ny+20]=0;
		}
		if(flag)ans.emplace_back(make_pair(x,y));
	}
	sort(ans.begin(),ans.end());
	int pos=unique(ans.begin(),ans.end())-ans.begin();
	for(int i=0;i<pos;i++)cout<<ans[i].first<<' '<<ans[i].second<<'\n';
	return 0;
}