You are given n distinct integers. Starting from an empty binary search tree, insert them in the order given, using the standard BST rule: to insert a key x, walk down from the root, going left if x is smaller than the current node and right if x is larger, until an empty spot is reached, where a new node is created. No rebalancing is performed.
You are then given q query keys; each query key is guaranteed to already be present in the tree. For each query key x, report its in-order successor: the smallest key in the tree that is strictly greater than x. If x is the maximum key, report -1.
Input format
Line 1: an integer n.
Line 2: n space-separated distinct integers — the keys, in insertion order.
Line 3: an integer q.
Line 4: q space-separated integers x_1 ... x_q, each equal to one of the n keys.
Output format
q lines. Line i contains the in-order successor of x_i, or -1 if x_i is the maximum key.
Constraints
- 1 ≤ n ≤ 40
- -1000 ≤ each key ≤ 1000, all keys distinct
- 1 ≤ q ≤ 40