import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

s = input()
k = ['R','U', 'D']
g = ['L', 'U', 'D']
isOK = True
i = 1
for t in s:
    if(i%2 == 0):
        isOK = t in g
    else:
        isOK = t in k
    if(isOK == False):
        break
    i += 1
print('Yes' if isOK else 'No') import sys, bisect, math, itertools, string, queue, copy sys bisect math itertools string queue copy def inp(): return int(input()) inp def inpm(): return map(int,input().split()) inpm def inpl(): return list(map(int, input().split())) inpl def inpls(): return list(input().split()) inpls def inplm(n): return list(int(input()) for _ in range(n)) inplm n n list(input()) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(input()) list input() input def inplL(n): return [list(input()) for _ in range(n)] inplL n n tuple(input()) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) tuple(input()) tuple input() input def inplT(n): return [tuple(input()) for _ in range(n)] inplT n n list(map(int, input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split def inpll(n): return [list(map(int, input().split())) for _ in range(n)] inpll n n list(map(int, input().split())) for _ in range(n) for _ in range(n) _ range(n) range n for _ in range(n) list(map(int, input().split())) list map(int, input().split()) map int input().split() ().split () input split def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) inplls n n s = input() s input() input k = ['R','U', 'D'] k ['R','U', 'D'] 'R' 'U' 'D' g = ['L', 'U', 'D'] g ['L', 'U', 'D'] 'L' 'U' 'D' isOK = True isOK True i = 1 i 1 for t in s:
    if(i%2 == 0):
        isOK = t in g
    else:
        isOK = t in k
    if(isOK == False):
        break
    i += 1 t s if(i%2 == 0):
        isOK = t in g
    else:
        isOK = t in k
     i%2 == 0 i%2 i 2 0 isOK = t in g isOK t in g t g isOK = t in k isOK t in k t k if(isOK == False):
        break
     isOK == False isOK False break i += 1 i 1 print('Yes' if isOK else 'No') print 'Yes' if isOK else 'No' isOK 'Yes' 'No' def inpm(): return map(int,input().split()) def inpm(): return map(int,input().split()) inpm isOK = t in k t in k isOK isOK = True True isOK def inpl(): return list(map(int, input().split())) def inpl(): return list(map(int, input().split())) inpl i = 1 1 i def inpls(): return list(input().split()) def inpls(): return list(input().split()) inpls def inplT(n): return [tuple(input()) for _ in range(n)] def inplT(n): return [tuple(input()) for _ in range(n)] inplT def inp(): return int(input()) def inp(): return int(input()) inp def inplL(n): return [list(input()) for _ in range(n)] def inplL(n): return [list(input()) for _ in range(n)] inplL i += 1 1 i k = ['R','U', 'D'] ['R','U', 'D'] k def inplm(n): return list(int(input()) for _ in range(n)) def inplm(n): return list(int(input()) for _ in range(n)) inplm def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)]) inplls g = ['L', 'U', 'D'] ['L', 'U', 'D'] g def inpll(n): return [list(map(int, input().split())) for _ in range(n)] def inpll(n): return [list(map(int, input().split())) for _ in range(n)] inpll s = input() input() s isOK = t in g t in g isOK
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

s = input()
k = ['R','U', 'D']
g = ['L', 'U', 'D']
isOK = True
i = 1
for t in s:
    if(i%2 == 0):
        isOK = t in g
    else:
        isOK = t in k
    if(isOK == False):
        break
    i += 1
print('Yes' if isOK else 'No')