Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Misha and Permutations Summation

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputLet's define the sum of two permutations *p* and *q* of numbers 0, 1, ..., (*n* - 1) as permutation , where *Perm*(*x*) is the *x*-th lexicographically permutation of numbers 0, 1, ..., (*n* - 1) (counting from zero), and *Ord*(*p*) is the number of permutation *p* in the lexicographical order.

For example, *Perm*(0) = (0, 1, ..., *n* - 2, *n* - 1), *Perm*(*n*! - 1) = (*n* - 1, *n* - 2, ..., 1, 0)

Misha has two permutations, *p* and *q*. Your task is to find their sum.

Permutation *a* = (*a*_{0}, *a*_{1}, ..., *a*_{n - 1}) is called to be lexicographically smaller than permutation *b* = (*b*_{0}, *b*_{1}, ..., *b*_{n - 1}), if for some *k* following conditions hold: *a*_{0} = *b*_{0}, *a*_{1} = *b*_{1}, ..., *a*_{k - 1} = *b*_{k - 1}, *a*_{k} < *b*_{k}.

Input

The first line contains an integer *n* (1 ≤ *n* ≤ 200 000).

The second line contains *n* distinct integers from 0 to *n* - 1, separated by a space, forming permutation *p*.

The third line contains *n* distinct integers from 0 to *n* - 1, separated by spaces, forming permutation *q*.

Output

Print *n* distinct integers from 0 to *n* - 1, forming the sum of the given permutations. Separate the numbers by spaces.

Examples

Input

2

0 1

0 1

Output

0 1

Input

2

0 1

1 0

Output

1 0

Input

3

1 2 0

2 1 0

Output

1 0 2

Note

Permutations of numbers from 0 to 1 in the lexicographical order: (0, 1), (1, 0).

In the first sample *Ord*(*p*) = 0 and *Ord*(*q*) = 0, so the answer is .

In the second sample *Ord*(*p*) = 0 and *Ord*(*q*) = 1, so the answer is .

Permutations of numbers from 0 to 2 in the lexicographical order: (0, 1, 2), (0, 2, 1), (1, 0, 2), (1, 2, 0), (2, 0, 1), (2, 1, 0).

In the third sample *Ord*(*p*) = 3 and *Ord*(*q*) = 5, so the answer is .

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/25/2017 00:21:01 (c3).

Desktop version, switch to mobile version.
User lists

Name |
---|