Problem D: Jumping rabbits

Upville and Downville host a very particular annual competition called Jumping Rabbits. Each town presents a team of rabbits and the two teams compete with one another to elect the Jumping Champion. Rabbits compete in pairs, one from each team, in what is called a pair match. A pair match consists in one single trial where both rabbits jump and the jumps are measured. After all pair matches have taken place, jumps are ranked and pair matches are assigned points accordingly. The rank of a given jump is given by its number of order in the ascending ordered list of jump heights, where equal heights have equal rankings. In a pair match where rabbits jumped H_u and H_d (where u and d refer to Upville and Downville, respectively), the points assigned to Upville are calculated by multiplying the overall ranking of H_u by the difference between H_u and H_d, while the points assigned to Downville are calculated by multiplying the overall ranking of H_d by the difference between H_d and H_u. The team that gathers most points, considering all pair matches, is the Jumping Champion team. In case both teams gather the same number of points there is a draw.

As an example, suppose this year’s “Jumping Rabbits” competition has only two pair matches, M₁ and M₂. In M₁ the Upville rabbit jumps 100 millimeters and the Downville rabbit jumps 150 millimeters. In M₂ the Upville rabbit jumps 150 millimeters and the Downville rabbit jumps 50 millimeters. We then have that Upville collects (100 - 150) × 2 = -100 points from M₁ (as 100 is a jump of rank 2) while Downville collects (150 - 100) × 3 = 150 points from M₁ (as 150 is a jump of rank 3). From M₂ Upville gathers (150 - 50) × 3 = 300 points while Downville gathers (50 - 150) × 1 = -100 points. Hence, this year’s Jumping Champion team is Upville with 200 points, against 50 points from Downville.

Task

Given a number of pair matches and the corresponding pairs of jump heights (in millimeters), your program must identify the Jumping Champion team in case there is one or conclude there is a draw.

Input

The first line contains one integer P that specifies the number of pair matches. The following P lines contain two integers each, separated by a single white space, specifying the jump heights H_u and H_d, in that order, where the u in H_u stands for Upville and the d in H_d stands for Downville.

Constraints

Output

The output consists in a single line containing the name of the winner (either Upville or Downville) or Draw in case there is one.

Input example 1

2
100 150
150 50

Output example 1

Upville

Input example 2

2
100 200
200 100

Output example 2

Draw