4734: Tree Construction
内存限制：256 MB
时间限制：2 S
标准输入输出
题目类型：传统
评测方式：文本比较
上传者：
提交：1
通过：1
题目描述
time limit per test
2 secondsmemory limit per test
256 megabytesinput
standard inputoutput
standard outputDuring the programming classes Vasya was assigned a difficult problem. However, he doesn't know how to code and was unable to find the solution in the Internet, so he asks you to help.
You are given a sequence a, consisting of n distinct integers, that is used to construct the binary search tree. Below is the formal description of the construction process.
You are given a sequence a, consisting of n distinct integers, that is used to construct the binary search tree. Below is the formal desc
- First element a1 becomes the root of the tree.
- Elements a2,a3,...,an are added one by one. To add element ai one needs to traverse the tree starting from the root and using the following rules:
- The pointer to the current node is set to the root.
- If ai is greater than the value in the current node, then its right child becomes the current node. Otherwise, the left child of the current node becomes the new current node.
- If at some point there is no required child, the new node is created, it is assigned value ai and becomes the corresponding child of the current node.
Input
The first line of the input contains a single integer n (2≤n≤100000)− the length of the sequence a.The second line contains n distinct integers ai (1≤ai≤109)− the sequence a itself.
Output
Output n-1 integers. For all i>1 print the value written in the node that is the parent of the node with value ai in it.Examples
Input
3
1 2 3
Output
1 2
Input
5
4 2 3 1 6
Output
4 2 2 4
Note
Picture below represents the tree obtained in the first sample.
Picture below represents the tree obtained in the second sample.
输入样例 复制
输出样例 复制