#include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
#include <complex>
#include <bitset>
#include <functional>
#include <stack>
#include <regex>
#include <tuple>
#include <iomanip>

#define rrep(i,n) for(int i=n-1;i>=0;i--)
#define RREP(i,a,n) for(int i=n-1;i>=a;i--)
#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,a,n) for(int i=a;i<n;i++)
#define all(a) (a).begin(),(a).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define sz(x) ((int)(x).size())
#define uniq(v) v.erase( unique(v.begin(), v.end()), v.end() );

#define fs first
#define sc second

#define MOD 1000000007
#define INF 1LL<<55

#define show(...) cerr<<#__VA_ARGS__<<" = ";_DEBUG(__VA_ARGS__)

using namespace std;

using ll = long long;

template<typename T1,typename T2> using P = pair< T1, T2 >;
using Pii = P<int,int>;
using Pll = P<ll,ll>;
using Pdd = P<double,double>;

template<typename T> using V = vector< T >;
using Vi = V<int>;
using Vii = V<pair<int, int>>;
using Vll = V<ll>;
using Vs = V<string>;

template<typename T1,typename T2> using M = map< T1, T2>;
using Mii = M<int, int>;
using Mll = M<ll, ll>;
using Msi = M<string, int>;

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

template<class T> istream& operator >>(istream &is, vector<T> &v){for(T &e:v)is>>e;return is;}
template<class T> ostream& operator <<(ostream &os, vector<T> v){os<<"{";for(T &e:v)os<<e<<(v.size()-(int)(&e-&v[0])>1?", ":"");os<<"}";return os;}

void _DEBUG(){}
template<typename H,typename... T> void _DEBUG(H a,T...b){cerr<<a<<(sizeof...(b)?",":"\n");_DEBUG(b...);}

inline void in(){}
template<typename H,typename... T>void in(H &a, T&... b){cin>>a;in(b...);}
inline void out(){}
template<typename H,typename... T> void out(H a, T... b){cout<<a<<(sizeof...(b)?" ":"\n");out(b...);}

template<class T> void resz(int n,T& v){v.resize(n);}
template<class H,class... T> void resz(int n,H& a,T&... b){a.resize(n);resz(n,b...);}

// please declaration dx[8], dy[8]
#define DX {-1,0,1,0,-1,-1,1,1}
#define DY {0,-1,0,1,-1,1,1,-1}
#define DX2 {-1,0,1,0}
#define DY2 {0,-1,0,1}


ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}// 最大公約数
Vll cd(ll a, ll b){Vll vec;ll z = gcd(a, b);for(ll j = 1; j <= z; j++){if(z % j == 0)vec.push_back(j);};return vec;} // 約数リストを取得
ll isP(ll a){if (a == 1) {return 0;} for(ll i = 2; i < int(sqrt(a)+1); i++) {if (a % i == 0) { return 0; }}; return 1;} // 素数かどうか
ll isPInclude1(ll a){for(ll i = 2; i < int(sqrt(a)+1); i++) {if (a % i == 0) { return 0; }}; return 1;} // 素数かどうか(1を含む)
ll lcm(ll a,ll b){return a*b/gcd(a,b);}// 最大公倍数
int factorial(int n){if(n > 1)return n * factorial(n - 1);else return 1;} // 階乗
int factorialWithPlus(int n){if(n > 1)return n + factorialWithPlus(n - 1);else return 1;} // 階乗のplus版
Vll primeFactorization(ll a){Vll vec;vec.push_back(1);for(ll i = 2; i*i <= a; i++){ if(a % i == 0) { while(a % i == 0){ a /= i; vec.push_back(i); } } }; if(a != 1){ vec.push_back(a); }; return vec;} // 素因数分解
void uni(vector<long long> vec){ sort(all(vec)); vec.erase(unique(all(vec)), vec.end()); }
struct io{io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);};}io;// io 高速化

signed main() {
  string s;
  in(s);

  rep(i, s.length()) {
    if (i % 2 == 0) {
      if (string("LUD").find(s[i]) == 0) {
        out("No");
        return 0;
      }
    }
    else if (i % 2 == 1) {
      if (string("RUD").find(s[i]) == 0) {
        out("No");
        return 0;
      }
    }
  }
  out("Yes");

  return 0;
}



Measured memory_bytes: 256