B'This is an interactive problem. Bob lives in a square grid of size n x n , with rows numbered 1 through n from top to bottom, and columns numbered 1 through n from left to right. Every cell is either allowed or blocked, but you don 't know the exact description of the grid. You are given only an integer n . Bob can move through allowed cells but only in some limited directions. When Bob is in an allowed cell in the grid, he can move down or right to an adjacent cell, if it is allowed. You can ask at most 4 cdot n queries of form "? r_1 c_1 r_2 c_2 " ( 1 <= r_1 <= r_2 <= n , 1 <= c_1 <= c_2 <= n ). The answer will be "YES" if Bob can get from a cell (r_1, c_1) to a cell (r_2, c_2) , and "NO" otherwise. In particular, if one of the two cells (or both) is a blocked cell then the answer is "NO" for sure. Since Bob doesn 't like short trips, you can only ask queries with the manhattan distance between the two cells at least n - 1 , i.e. the following condition must be satisfied: (r_2 - r_1) + (c_2 - c_1) ge n - 1 . It 's guaranteed that Bob can get from the top-left corner (1, 1) to the bottom-right corner (n, n) and your task is to find a way to do it. You should print the answer in form "! S" where S is a string of length 2 cdot n - 2 consisting of characters 'D ' and 'R ', denoting moves down and right respectively. The down move increases the first coordinate by 1 , the right move increases the second coordinate by 1 . If there are multiple solutions, any of them will be accepted. You should terminate immediately after printing the solution. The only line of the input contains an integer n ( 2 <= n <= 500 ) -- the size of the grid. When you are ready to print the answer, print a single line containing "! S" where where S is a string of length 2 cdot n - 2 consisting of characters 'D ' and 'R ', denot'...