M-kun has the following three cards:

• A red card with the integer A.
• A green card with the integer B.
• A blue card with the integer C.

He is a genius magician who can do the following operation at most K times:

• Choose one of the three cards and multiply the written integer by 2.

His magic is successful if both of the following conditions are satisfied after the operations:

• The integer on the green card is strictly greater than the integer on the red card.
• The integer on the blue card is strictly greater than the integer on the green card.

Determine whether the magic can be successful.

Constraints

• $1 \leq A, B, C \leq 7$
• $1 \leq K \leq 7$
• All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C
K

Output

If the magic can be successful, print Yes; otherwise, print No.

Examples

Input

7 2 5
3

Output

Yes

Input

7 4 2
3

Output

No

见题面

见题面