Deepak and Rachit are very fond of playing games. They are getting bored hence they have decided to play a game. One of them has taken one rupee. Now they has started playing the game as follows: the player having the turn can multiply the money with a particular number between 2 to 9 and pass the money to other player. For example initially if Deepak is having 1 rupee with him , therefore he can multiply the money by any number from 2 to 9 and pass it to Rachit.Now Rachit can do the same thing and pass it to Deepak. So you are given a particular number n 1 < n < 10^9. The player whose multiplication results in amount >= n gets all of the money. You are also given the player name who must win this game (suppose x) , you have to tell which player must have initial 1 rupee so that it can be guaranteed that x will win. (It is given that both players play optimally i.e. both player plays the best move for him to win)
INPUT: First line contains t-number of test cases . Next t lines contains a integer n. t <= 10^5 1 < n < 10^9
OUTPUT: for each test case you must output the player name as "Deepak" or "Rachit" who must have intial 1 ruppee.