{"problem":{"name":"Tap Dance","description":{"content":"Takahashi will do a tap dance. The dance is described by a string $S$ where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will fol","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc141_b"},"statements":[{"statement_type":"Markdown","content":"Takahashi will do a tap dance. The dance is described by a string $S$ where each character is `L`, `R`, `U`, or `D`. These characters indicate the positions on which Takahashi should step. He will follow these instructions one by one in order, starting with the first character.\n$S$ is said to be _easily playable_ if and only if it satisfies both of the following conditions:\n\n*   Every character in an odd position ($1$\\-st, $3$\\-rd, $5$\\-th, $\\ldots$) is `R`, `U`, or `D`.\n*   Every character in an even position ($2$\\-nd, $4$\\-th, $6$\\-th, $\\ldots$) is `L`, `U`, or `D`.\n\nYour task is to print `Yes` if $S$ is easily playable, and `No` otherwise.\n\n## Constraints\n\n*   $S$ is a string of length between $1$ and $100$ (inclusive).\n*   Each character of $S$ is `L`, `R`, `U`, or `D`.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc141_b","tags":[],"sample_group":[["RUDLUDR","Yes\n\nEvery character in an odd position ($1$\\-st, $3$\\-rd, $5$\\-th, $7$\\-th) is `R`, `U`, or `D`.\nEvery character in an even position ($2$\\-nd, $4$\\-th, $6$\\-th) is `L`, `U`, or `D`.\nThus, $S$ is easily playable."],["DULL","No\n\nThe $3$\\-rd character is not `R`, `U`, nor `D`, so $S$ is not easily playable."],["UUUUUUUUUUUUUUU","Yes"],["ULURU","No"],["RDULULDURURLRDULRLR","Yes"]],"created_at":"2026-03-03 11:01:14"}}