#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1010;
char r[N][N];

void solve_even(int n, int o) {
	if (n <= 0) return;
	for (int i = 0; i < n; i += 2) {
		r[o][o + i] = 'U';
		r[o + i][o + n - 1] = 'R';
	}
	for (int i = 1; i < n; i += 2) {
		r[o + n - 1][o + i] = 'D';
		r[o + i][o] = 'L';
	}
	solve_even(n - 2, o + 1);
}

void solve_odd(int n, int o) {
	if (n <= 0) return;
	for (int i = 0; i < n; i += 2) {
		r[o + n - 1][o + i] = 'D';
		r[o][o + i] = 'U';
	}
	for (int i = 1; i < n; i += 2) {
		r[o + i][o + n - 1] = 'R';
		r[o + i][o] = 'L';
	}
	solve_odd(n - 2, o + 1);
}

int main() {
	int n; scanf("%d", &n);
	if (n % 2 == 0) {
		solve_even(n, 0);	
	} else {
		solve_odd(n, 0);
		r[n / 2 + 1][n / 2] = 'U';
	}
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			printf("%c", r[i][j] > 0 ? r[i][j] : '.');
		}
		printf("\n");
	}
}