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 java.io.*;
import java.util.*;

public class e {
    static class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner(Reader in) {
            br = new BufferedReader(in);
        }

        public FastScanner() {
            this(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int idx = 0; idx < n; idx++) {
                a[idx] = nextInt();
            }
            return a;
        }
    }
    public static void main(String[] args) {
        
        FastScanner sc = new FastScanner();
        String s = sc.nextLine();
        int n = Integer.parseInt(s);
        String s2 = sc.nextLine();
        String[] cc = s2.split(" ");
        int[] a = new int[n];
        int[] b = new int[n];
        int[] c = new int[n];
        int[] next = new int[n];
        int[] before=new int[n];
        boolean bo= true;
        for(int i=0;i<n;i++)
        {
            a[i] = Integer.parseInt(cc[i]);
        }
        for(int i=0;i<n;i++)
        {
            c[i]=0;
        }
        String s1 = sc.nextLine();
        String[] c1 = s1.split(" ");
        for(int i=0;i<n;i++)
        {
            int x = Integer.parseInt(c1[i]);
            c[x]++;
        }
        int start=-1,now=0;
        for(int i=0;i<n;i++)
        {
            if(c[i]!=0)
            {
                if(start==-1) start=i;
                before[i] = now;
                for(int j=now;j<i;j++)
                {
                    next[j]=i;
                }
                now=i;
            }
            if(i==n-1)
            {
                if(start==-1) start=i;
                before[start] = now;
                for(int j=now;j<=i;j++)
                {
                    next[j]=start;
                }
            }
        }
        for(int i=0;i<n;i++)
        {
            int x = n-a[i];
            if(x==n) x=start;
            //System.out.println(x);
            while(c[x]==0)
            {
                x=next[x];
            }
            c[x]--;
            if(c[x]==0)
            {
                if(x==start) start = next[x];
                next[before[x]] = next[x];
                before[next[x]]=before[x];
            }
            b[i] = (a[i]+x)%n;
        }
        for(int i=0;i<n;i++)
        {
            if(i<n-1)
                System.out.print(b[i]+" ");
            else
                System.out.print(b[i]);
            
        }
        System.out.println();
    }
}