Cheapest and dearest price

Problem

A shop keeps item prices in a binary search tree. Print the smallest and the largest price, separated by a space.

Input: Line 1: the tree in level order, keys separated by spaces, with # for a missing child. The children of a missing node are not listed, and trailing # may be left out. A single # is an empty tree.
Output: Two integers: the smallest key and the largest key.
Constraints: 1 ≤ number of nodes ≤ 300
1 ≤ each key ≤ 1000000, all different

Example 1

Input

8 3 10 1 6 # 14 # # 4 7 13

Output

1 14

Example 2

Input

Output

5 5

A single node is both.

Try the problem first. Open one hint at a time.

Hint 1

The smallest key is where the left links end.

Hint 2

The largest key is where the right links end.

Write your Python code, run it on the examples and submit it to hidden tests.