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.
A, B, C = list(map(int, input().split()))
K = int(input())
L=[]
L.append(A)
L.append(B)
L.append(C)


n = 0
while L[0] >= L[1]:
    L[1] = L[1]*2
    n = n+1



while L[1] >= L[2]:
    L[2] = L[2]*2
    n = n+1


if n <= K:
    print("yes")
else:
    print("No")
A, B, C = list(map(int, input().split()))
K = int(input())
L=[]
L.append(A)
L.append(B)
L.append(C)


n = 0
while L[0] >= L[1]:
    L[1] = L[1]*2
    n = n+1



while L[1] >= L[2]:
    L[2] = L[2]*2
    n = n+1


if n <= K:
    print("Yes")
else:
    print("No")
    