#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#include <algorithm>
#include <cmath>
#include <random>
#include <ctime>
#include <cstdlib>
#include <chrono>

using namespace std;

void solve() {
  int n;
  cin >> n;

  if (n == 1) {
    cout << "L\n";
    return;
  }
  
  vector<string> v(n);
  for (int i = 0; i < n; ++i) {
    v[i].resize(n);
    for (auto &it : v[i]) {
      it = '.';
    }
  }

  for (int k = 0; k < (n + 1) / 2; k += 2) {
    if (n - 2 * k == 1) {
      v[k][k] = 'U';
      v[k+1][k] = 'U';
      break;
    }

    v[k][k] = 'U';
    for (int i = k, j = k + 1; j < n - k; ++j) {
      v[i][j] = 'R';
    }
    
    for (int i = k + 1, j = n - k - 1; i < n - k; ++i) {
      v[i][j] = 'D';
    }
    
    for (int i = n - k - 1, j = n - k - 2; j >= k; --j) {
      v[i][j] = 'L';
    }
    
    for (int i = k + 1, j = k; i < n - k - 1; ++i) {
      v[i][j] = 'U';
    }
  }

  for (int i = 0; i < n; ++i) {
    cout << v[i] << "\n";
  }
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);

  int t = 1;
  while (t--)
    solve();

  return 0;
}