2572. Sort it…

输入格式

The standard input of the problem consists of two parts. At first, a database is written, and then there’s a sequence of queries. The format of database is very simple: in the first line there’s a number $N(1⩽N⩽100000)$, in the next N lines there are numbers of the database one in each line in an arbitrary order. A sequence of queries is written simply as well: in the first line of the sequence a number of queries $K(1⩽K⩽100)$ is written, and in the next $K$ lines there are queries one in each line. The query “Which element is i-th by its value?” is coded by the number i.

输出格式

The output should consist of K lines. In each line there should be an answer to the corresponding query. The answer to the query “i” is an element from the database, which is i-th by its value (in the order from the least up to the greatest element).

5
7
121
123
7
121
3
3
2
5

121
7
123

提示

Hint
After we sort the data we get 7 7 121 121 123,so the postion 3 is 121,the postion 2 is 7 and the position 5 is 123 etc.