#include <stdio.h>
#include <string.h>
#include <algorithm>

int const MAXN = 1024;

char f[MAXN][MAXN];
char s[MAXN];

void step(char ch, int & x, int & y)
{
	switch(ch)
	{
		case 'U':
			-- y; break;
		case 'D':
			++ y;	break;
		case 'L':
			-- x;	break;
		case 'R':
			++ x;	break;
	}
}

int main()
{
	int n;
	scanf("%d %s", &n, s);

	memset(f, '.', sizeof(f));
	int miny = 0, minx = 0, maxx = 0, maxy = 0, x = 0, y = 0;
	for (int i = 0; i < n; ++ i)
	{
		step(s[i], x, y);
		maxx = std::max(maxx, x);
		maxy = std::max(maxy, y);
		minx = std::min(minx, x);
		miny = std::min(miny, y);
	}
	x = 0, y = 0;
	f[y - miny][x - minx] = '*';
	for (int i = 0; i < n; ++ i)
	{
		step(s[i], x, y);
		f[y - miny][x - minx] = '*';
	}
	int h = maxy - miny + 1;
	int w = maxx - minx + 1;
	for (int i = 0; i < h; ++ i)
	{
		f[i][w] = 0;
		printf("%s\n", f[i]);
	}
	return 0;
}