There is a fancy new game called Map-le. This game requires people to create maps! Being a gaming enthusiast such as yourself, you have decided to create a programme to dominate the Map-le scoreboards.
The game of Map-le is played as follows: The player gets an integer, n. Then s/he will receive n strings of location names. This is followed by n integers. the ith string corresponds with the ith integer. The player will then have to sort the locations based on the numbers given, and list out the order of locations a tourist will visit.
Input
An integer, n.
n strings which are at most 20 characters long
n integers, all of which are < 232
Output
The ordered list of locations a tourist will visit.
Subtasks
For 50% of the testcases, n ≤ 2000.
For 100% of the testcases, n ≤ 1000000.
Sample Input
3
singapore shenchen java
3 1 2
Sample Output
shenchen
java
singapore