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

const int N = 1203;

char grid[N][N];

void rec(int n, int idx){
	if(n == 2){
		grid[idx][idx] = 'L';
		grid[idx][idx+1] = 'U';
		grid[idx+1][idx] = 'D';
		grid[idx+1][idx+1] = 'R';
		return ;
	}
	if(n == 3){
		grid[idx][idx] = 'L';
		grid[idx][idx+1] = 'U';
		grid[idx][idx+2] = 'R';
		grid[idx+1][idx] = 'R';
		grid[idx+1][idx+1] = '.';
		grid[idx+1][idx+2] = 'L';
		grid[idx+2][idx] = 'L';
		grid[idx+2][idx+1] = 'D';
		grid[idx+2][idx+2] = 'R';
		return ;
	}
	if(n&1){
		for(int i=1;i<n-1;i++){
			grid[idx][idx+i] = (i&1)?'U':'.';
		}
		for(int i=1;i<n-1;i++){
			grid[idx+n-1][idx+i] = (i&1)?'D':'.';
		}
		for(int i=0;i<n;i++){
			grid[idx+i][idx] = (i&1)?'.':'L';
		}
		for(int i=0;i<n;i++){
			grid[idx+i][idx+n-1] = (i&1)?'.':'R';
		}
		rec(n-2, idx+1);
	}else{
		for(int i=1;i<n;i++){
			grid[idx][idx+i] = (i&1)?'U':'.';
		}
		for(int i=0;i<n-1;i++){
			grid[idx+n-1][idx+i] = (i&1)?'.':'D';
		}
		for(int i=0;i<n-1;i++){
			grid[idx+i][idx] = (i&1)?'.':'L';
		}
		for(int i=1;i<n;i++){
			grid[idx+i][idx+n-1] = (i&1)?'R':'.';
		}
		rec(n-2,idx+1);
	}
}

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	
	int n;
	cin>>n;
	if(n == 1){
		cout<<'U';
		return 0;
	}
	rec(n, 0);
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			cout<<grid[i][j];
		}
		cout<<'\n';
	}
	
	return 0;
}