Candy Game

Joe and Dave are playing a game with $N$ candies placed on a table.

Starting with Joe, they take turns taking one candy at a time.

The player who has no candy left to take loses the game, and the player who takes the last candy wins.

Given the number of candies $N$, write a program that determines who wins the game.

The first line contains the number of candies, $N$. ($1 \le N \le 100\,000$)

Print J if Joe wins, and D if Dave wins.