eolymp
bolt
Try our new interface for solving problems
Problems

Height of the Tree

Height of the Tree

Time limit 1 second
Memory limit 64 MiB

Implement the binary search tree for integers. The program reads a sequence of integers and builds a tree from them. Elements are inserted to the tree according to the search results of their place. If the item already exists in the tree, do not add it. The balance operations on the tree are not performed.

Find the height of the built tree.

Input data

The program receives a sequence of integers. The sequence ends with the number 0, which means the end of input, do not add it to the tree. It is guaranteed that the input sequence contains no more than 10^5 numbers, each of them does not exceed 2·10^9 in absolute value.

Output data

Print one number - the height of the resulting tree.

Example corresponds to the following tree:

Note that the height of the tree is measured in vertices.

Examples

Input example #1
7 3 2 1 9 5 4 6 8 0
Output example #1
4