#include <map>
#include <set>
#include <array>
#include <cmath>
#include <deque>
#include <bitset>
#include <random>
#include <string>
#include <vector>
#include <cassert>
#include <complex>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>

using namespace std;

void solve(int l, int r, int p, vector<vector<char>>& tab) {
    if (r - l == 0) {
        return;
    } else if (r - l == 1) {
        if (p == 0) {
            tab[l][l] = 'U';
            return;
        } else {
            tab[l - 1][l] = 'D';
            tab[l][l] = 'D';
        }
        return;
    } else if ((r - l) % 2 == 0) {
        for (int i = l; i < r; i += 2) {
            tab[l][i] = 'U';
            tab[r - 1][i + 1] = 'D';
        }
        for (int j = l; j < r; j += 2) {
            tab[j + 1][l] = 'L';
            tab[j][r - 1] = 'R';
        }
        solve(l + 1, r - 1, 0, tab);
    } else {
        for (int i = l; i < r; i += 2) {
            tab[l][i] = 'U';
            tab[r - 1][i] = 'D';
        }
        for (int j = l + 1; j < r; j += 2) {
            tab[j][l] = 'L';
            tab[j][r - 1] = 'R';
        }
        solve(l + 1, r - 1, 1, tab);
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int n;
    cin >> n;
    vector<vector<char>> tab(n, vector<char>(n, '.'));

    solve(0, n, 0, tab);

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << tab[i][j];
        }
        cout << '\n';
    }


    return 0;
}