Game#456

Game

1 second
64 megabytes
Very hard

Alice and Bob play the following game. First, they collect small stones and put them in one pile. Then they take turns, beginning with Alice, and throw a coin. If a player throws heads, they take a heap of stones; if tails, then they do not take it. The winner is the one who takes the last stone. The players are known to have the ability to throw the desired side of a coin. More precisely, if Alice wants to throw her preferred side of the coin, then she achieves it with probability . The same probability for Bob is . It is required to find the probability with which Alice will win the game, provided that both players play optimally.

Input

The first line contains one integer (1 \leq N \leq 99\,999\,999). The second line contains , and the third contains (0.5 \leq P, Q \leq 0.999\,999\,99). The probabilities are given with no more than eight digits after the decimal point.

Output

Output one real number — the probability with which Alice will win the game. Display the result with an accuracy of decimal places.

Examples

Example 1

Loading
Loading