Implement a binary search tree for integers. The program reads a sequence of integers and builds a tree from them. Each element is inserted according to its search result in the tree. If an element already exists in the tree, do not add it again. The tree is not balanced.
Find the number of elements in the resulting tree.
The program receives a sequence of integers. The sequence ends with the number , which marks the end of input and should not be added to the tree. It is guaranteed that the input sequence contains no more than 10^5 elements, each of which does not exceed 2 \cdot 10^9 in absolute value.
Print a single number — the number of elements in the built tree.
Example 1