#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;

int main(){
    int T;
    cin>>T;

    string ans="RRRDDLLLDD";
    if(T<ans.size()){
        cout<<ans.substr(0,T)<<endl;
        return 0;
    }
    string c="RRRDDLLLDD";
    int len=ans.size();
    cout<<ans;
    T-=len;
    int cycle=c.size();
    while(T>0){
        if(T>cycle){
            cout<<c;
            T-=cycle;
        }
        else{
            cout<<c.substr(0,T)<<endl;
        }
    }

}