import java.util.*;


public class TestProg
{

   public static void main(String[] args)
   {
      Scanner in = new Scanner(System.in);
      
      Tree24 T = new Tree24();

      T.put("04", 1); T.printTree(); System.out.println();
      T.put("12", 1); T.printTree(); System.out.println();
      T.put("06", 1); T.printTree(); System.out.println();

      System.out.println("\n ***** Watch the SPLIT !!!\n");

      T.put("15", 1); T.printTree(); System.out.println();
      T.put("03", 1); T.printTree(); System.out.println();

      System.out.println("\n ***** Watch the SPLIT !!!\n");
      T.put("05", 1); T.printTree(); System.out.println();

      System.out.println("\n ----- We now fill up for cascaded split.... \n");

      T.put("08", 1); T.printTree(); System.out.println();
      T.put("10", 1); T.printTree(); System.out.println();
      T.put("13", 1); T.printTree(); System.out.println();
      T.put("14", 1); T.printTree(); System.out.println();

      System.out.println("\n ***** split, but NOT cascaded  \n");
      T.put("11", 1); T.printTree(); System.out.println();

      System.out.println("\n +++++ Notice ROOT is filled up\n");
      System.out.println("\n ***** CASCADED SPLIT \n");

      T.put("17", 1); T.printTree(); System.out.println();
   }

}