Question

Simple Arrangement

Given an array A (0 indexed) of n integers from 0 to n-1 (each integer exactly once), output an array such that A[i] becomes A[A[i]]. Make sure you don't use extra memory than the array itself.

Input

The first line of the input contains a number n, the number of integers in the array.

The second line of the input contains n numbers, the elements of A.

1 <= n <= 100000

0 <= A[i] <= n-1

The second line of the input contains n numbers, the elements of A.

**Constraints:**1 <= n <= 100000

0 <= A[i] <= n-1

Output

Output the required array of n integers.

Example

Sample Input 1:

5

4 2 3 0 1

Sample Output 1:

1 3 0 4 2

Sample Input 2:

10

9 5 1 4 7 8 0 6 3 2

Sample Output 2:

2 8 5 7 6 3 9 0 4 1

A[0] will be A[A[0]]=A[4]=1

A[1] will be A[A[1]]=A[2]=3

A[2] will be A[A[2]]=A[3]=0

A[3] will be A[A[3]]=A[0]=4

A[4] will be A[A[4]]=A[1]=2

5

4 2 3 0 1

Sample Output 1:

1 3 0 4 2

Sample Input 2:

10

9 5 1 4 7 8 0 6 3 2

Sample Output 2:

2 8 5 7 6 3 9 0 4 1

**Explanation 1:**A[0] will be A[A[0]]=A[4]=1

A[1] will be A[A[1]]=A[2]=3

A[2] will be A[A[2]]=A[3]=0

A[3] will be A[A[3]]=A[0]=4

A[4] will be A[A[4]]=A[1]=2