#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }


int N;
char a[1010][1010];

int main() {
  for (; ~scanf("%d", &N); ) {
    for (int x = 0; x < N; ++x) {
      fill(a[x], a[x] + N, '.');
      a[x][N] = 0;
    }
    
    if (N == 1) {
      a[0][0] = 'U';
    } else if (N % 2 != 0) {
      int l = 0, r = N - 1;
      for (; r - l + 1 >= 5; ++l, --r) {
        for (int i = l; i <= r; i += 2) {
          a[i][l] = 'L';
          a[i][r] = 'R';
        }
        for (int i = l + 1; i <= r; i += 2) {
          a[r][i] = 'D';
          a[l][i] = 'U';
        }
      }
      a[l + 0][l + 0] = 'L'; a[l + 0][l + 1] = 'L'; a[l + 0][l + 2] = 'U';
      a[l + 1][l + 0] = 'D'; a[l + 1][l + 1] = '.'; a[l + 1][l + 2] = 'U';
      a[l + 2][l + 0] = 'D'; a[l + 2][l + 1] = 'R'; a[l + 2][l + 2] = 'R';
    } else {
      int l = 0, r = N - 1;
      for (; r - l + 1 >= 2; ++l, --r) {
        for (int i = l; i <= r; i += 2) {
          a[i][l] = 'L';
          a[r][i] = 'D';
        }
        for (int i = l + 1; i <= r; i += 2) {
          a[i][r] = 'R';
          a[l][i] = 'U';
        }
      }
    }
    
    for (int x = 0; x < N; ++x) {
      puts(a[x]);
    }
  }
  return 0;
}