Last One Standing

In a computer game units are described by their health , damage , and time to reload .

When such a unit fires a missile at an opposing
one - the opponent's health is decreased by   seconds after the missile is fired. 
The time between consecutive missile launches for the same unit should be at least  seconds. 

For simplicity, we assume the missile supply to be infinite for all units in the game.

Two players - one controlling a unit with health , damage  and time to 
reload , and the second with a unit described by ,  and  - have engaged
in a fight in this computer game. Both units are fully reloaded at the beginning of the fight
and can fire missiles immediately.

The unit is destroyed when its health becomes zero or negative. A player wins if there 
is a moment in time such that the opponent's unit is destroyed, while theirs is not.

Since it takes 0.5 seconds for a missile to reach its target, it is possible
for both units to fire missiles at the same time and ultimately destroy each other.

You are to determine who wins in case both players act optimally.

Input
	itemize
One line containing the integer numbers ,  and  ().
One line containing the integer numbers ,  and  ().
	itemize

Output
Output the phrase player one if the first player wins, player two
if the second player wins, or draw if neither player wins.
