{"raw_statement":[{"iden":"problem statement","content":"Takahashi is on a two-dimensional plane. Starting from the origin, he made $N$ moves.\nThe $N$ moves are represented by a string of length $N$ as described below:\n\n*   Takahashi's coordinates after the $i$\\-th move are:\n    \n    *   $(x+1,y)$ if the $i$\\-th character of $S$ is `R`;\n    *   $(x-1,y)$ if the $i$\\-th character of $S$ is `L`;\n    *   $(x,y+1)$ if the $i$\\-th character of $S$ is `U`; and\n    *   $(x,y-1)$ if the $i$\\-th character of $S$ is `D`,\n    \n    where $(x,y)$ is his coordinates before the move.\n    \n\nDetermine if Takahashi visited the same coordinates multiple times in the course of the $N$ moves (including the starting and ending points)."},{"iden":"constraints","content":"*   $1 \\leq N \\leq 2\\times 10^5$\n*   $N$ is an integer.\n*   $S$ is a string of length $N$ consisting of `R`, `L`, `U`, and `D`."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$\n$S$"},{"iden":"sample input 1","content":"5\nRLURU"},{"iden":"sample output 1","content":"Yes\n\nTakahashi's coordinates change as follows: $(0,0)\\to (1,0)\\to (0,0)\\to (0,1)\\to (1,1)\\to (1,2)$."},{"iden":"sample input 2","content":"20\nURDDLLUUURRRDDDDLLLL"},{"iden":"sample output 2","content":"No"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}