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.

Print the list of all leaves in a tree (the vertices that do not have children) in increasing order.

Input

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 105 numbers, each of them does not exceed 2 * 109 in absolute value.

Output

Print the list of all leaves in a tree in increasing order.