import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;

public class Main {
	public static void main(String args[]){//double 处理果盘
		Scanner in = new Scanner(System.in);
		String str = in.nextLine();
		char[] s = str.toCharArray();
		String sl = "",sr="";
		for (int i=0;i<str.length();i++){
			if(i % 2==0){
				sl += s[i];
			}else{
				sr += s[i];
			}
		}
//		if(sl.indexOf('L')!= -1 || sr.indexOf('R')!= -1){
//			System.out.println("No");
//		}else{
//			System.out.println("Yes");
//		}
		boolean f = true;
		char[] cl = sl.toCharArray();
		char[] cr = sr.toCharArray();
		for (int i=0;i<sl.length();i++){
			if(cl[i] == 'R' || cl[i] =='U' || cl[i] =='D'){
				
			}else{
				f = false;
				break;
			}
		}
		for (int i=0;i<sr.length();i++){
			if(cr[i] == 'L' || cr[i] =='U' || cr[i] =='D'){
				
			}else{
				f = false;
				break;
			}
		}
		if(f)
			System.out.print("Yes");
		else
			System.out.print("No");
	}
}	
	
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz