// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

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

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

void solve() {
    int t;
    cin >> t;
    string s = "DUDRDUDRDUDRDUDLLLRULUUU";

    string ans = "";
    FOR(t) ans.push_back(s[i%(int)s.size()]);
    cout << ans << endl;

    // int x = 1, y = 1;
    // int gx = -1, gy = -1, ngx = 1, ngy = 1;
    // rep(zi, 3*s.size()) {
    //     int i = zi % s.size();
    //     if(zi%4==0 && zi != 0) {
    //         // gx = ngx;
    //         // gy = ngy;
    //         ngx = x;
    //         ngy = y;
    //     }
    //     if(zi%4==3) {
    //         gx = ngx;
    //         gy = ngy;
    //     }
    //     if(s[i] == 'D') x++;
    //     if(s[i] == 'U') x--;
    //     if(s[i] == 'R') y++;
    //     if(s[i] == 'L') y--;

    //     cout << x << " " << y << " : " << gx << " " << gy << endl;
    //     if(x == gx || y == gy) cout << "NG" << endl;
    // }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}