You are given two arrays a and b, both of length n. All elements of both arrays are from 0 to n-1.

You can reorder elements of the array b (if you want, you may leave the order of elements as it is). After that, let array c be the array of length n, the i-th element of this array is c_i = (a_i + b_i) \% n, where x \% y is x modulo y.

Your task is to reorder elements of the array b to obtain the lexicographically minimum possible array c.

Array x of length n is lexicographically less than array y of length n, if there exists such i (1 ≤ i ≤ n), that x_i < y_i, and for any j (1 ≤ j < i) x_j = y_j.

Input

The first line of the input contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of elements in a, b and c.

The second line of the input contains n integers a_1, a_2, ..., a_n (0 ≤ a_i < n), where a_i is the i-th element of a.

The third line of the input contains n integers b_1, b_2, ..., b_n (0 ≤ b_i < n), where b_i is the i-th element of b.

Output

Print the lexicographically minimum possible array c. Recall that your task is to reorder elements of the array b and obtain the lexicographically minimum possible array c, where the i-th element of c is c_i = (a_i + b_i) \% n.

Examples

Input


4
0 1 2 1
3 2 1 1


Output


1 0 0 2 


Input


7
2 5 1 5 3 4 3
2 4 3 5 6 5 1


Output


0 0 0 1 0 2 4 
import sys
range = xrange
input = raw_input

class segtree(object):
    def __init__(self,n,data):
        m = 1
        while m<n:m*=2
        self.n = n
        self.m = m
        self.data = [0]*(m+m)
        
        for i in range(len(data)):
            self.data[m+data[i]] += 1

        for i in reversed(range(1,m)):
            self.data[i] = self.data[2*i] + self.data[2*i+1]

    def add(self,i,val):
        i += self.m
        while i:
            self.data[i] += val
            i //= 2

    def find(self,l,r):
        l += self.m
        r += self.m

        segsl = []
        segsr = []
        while l<r:
            if l&1:
                segsl.append(l)
                l += 1
            if r&1:
                r -= 1
                segsr.append(r)
            l//=2
            r//=2
        
        segs = segsl + segsr[::-1]
        for s in segs:
            if self.data[s]>0:
                while s<self.m:
                    s *= 2
                    if self.data[s]==0:
                        s += 1
                return s - self.m
        return -1

n = int(input())

A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
C = []

seg = segtree(n,B)

for i in range(n):
    a = A[i]
    # best is a+b>=n
    # n-a <= b

    b1 = seg.find(n-a,n)
    b2 = seg.find(0,n-a)

    if b1 == -1:
        b = b2
    elif b2 == -1:
        b = b1
    elif (a+b1)%n < (a+b2)%n:
        b = b1
    else:
        b = b2

    seg.add(b, -1)
    C.append((a+b)%n)

print ' '.join(str(c) for c in C)
