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


import java.util.Map.Entry;
import java.util.*;
 
//import org.w3c.dom.css.Counter;
 
public class Main {
//public class App {
 
    public static void main(final String[] args){
     //スキャン
     final Scanner s = new Scanner(System.in);
      int A = Integer.parseInt(s.next());
      int B = Integer.parseInt(s.next());
      int C = Integer.parseInt(s.next());
     final int X = Integer.parseInt(s.next());
     int count =0;
    
     while (A>=B) {
        B = B *2;
        //System.out.println(B);
        count++;
     }
    
     while (B>=C) {
        C = C *2;
        //System.out.println(B);
        count++;
     }
     if(count<=X){
        System.out.println("Yes");
     }else{
        System.out.println("No");
     }
     
 

    
/*
     for(int i=0; i< K;i++){
        int di = Integer.pa rseInt(s.next());
        String blank = s.nextLine();
        String huge = s.nextLine();

        String[] hage = huge.split(" ",0);
        int hageN= hage.length;
        for (int num =0;num<hageN;num++){
            if(!hashSet.contains(hage[num])){
                hashSet.add(hage[num]);
            }
        }

     }
     s.close();

     System.out.println(N-hashSet.size());


}
*/
}
}