Given a binary tree, write a function to find the length of the longest consecutive branch in increasing order.

Sample Input

tree =    0
       /     \
      1       2
    /   \   /   \
   1     2 1     3   
        /          \
       3            4

Sample Output

4