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.
import sys


def resolve(in_):
    a, b, c = map(int, next(in_).split())
    k = int(next(in_))
    for _ in range(7):
        if a >= b:
            b * 2
        elif b >= c:
            c * 2
        else:
            break
    return 'Yes' if a < b and b < c else 'No'


def main():
    answer = resolve(sys.stdin.buffer)
    print(answer)


if __name__ == '__main__':
    main()
import sys


def resolve(in_):
    a, b, c = map(int, next(in_).split())
    k = int(next(in_))
    for _ in range(k):
        if a >= b:
            b *= 2
        elif b >= c:
            c *= 2
        else:
            break
    return 'Yes' if a < b and b < c else 'No'


def main():
    answer = resolve(sys.stdin.buffer)
    print(answer)


if __name__ == '__main__':
    main()