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.HashSet;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class E {
    String filename = null;
    final int INF = 1_000_000_000;


    void solve(){
        int n = readInt();
        int[] a = new int[n];
        int[] b = new int[n];
        int[] q = new int[n];
        int[] w = new int[n];
        for(int i = 0;i<n;i++){
            a[i] = readInt();
            q[a[i]]++;
        }
        for(int i = 0;i<n;i++){
            b[i] = readInt();
            w[b[i]]++;
        }

        TreeSet<Integer> set = new TreeSet<>();
        for(int i = 0;i<n;i++){
            if(w[i] > 0) set.add(i);
        }

        int[] c = new int[n];
        for(int i = 0;i<n;i++){
            int x = n - a[i];

            Integer left = set.ceiling(x);
            Integer right = set.ceiling(0);

            if(left == null){
                c[i] = (right + a[i]) % n;
                w[right]--;
                if(w[right] == 0) set.remove(right);
            }else if(right == null){
                c[i] = (left + a[i]) % n;
                w[left]--;
                if(w[left] == 0) set.remove(left);
            }else if((right + a[i]) % n < (left + a[i]) % n){
                c[i] = (right + a[i]) % n;
                w[right]--;
                if(w[right] == 0) set.remove(right);
            }else{
                c[i] = (left + a[i]) % n;
                w[left]--;
                if(w[left] == 0) set.remove(left);
            }
        }
        for(int i = 0;i<n;i++){
            out.print(c[i] + " ");
        }
    }
    public static void main(String[] args) {
        new E().run();
    }
    private void run() {
        try {
            init();
            solve();
            out.close();
        } catch (Exception e) {
            e.printStackTrace();
            System.exit(-1);
        }
    }

    private BufferedReader in;
    private StringTokenizer tok = new StringTokenizer("");

    private PrintWriter out;

    private void init() {
        if (filename == null) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
            return;
        }

        try {
            in = new BufferedReader(new FileReader(new File(filename)));
            out = new PrintWriter(new File(filename));
        } catch (FileNotFoundException e) {
            e.printStackTrace();
        }

    }
    private String readLine() {
        try {
            return in.readLine();
        } catch (IOException e) {
            throw new RuntimeException(e);
        }
    }

    private String readString() {
        while (!tok.hasMoreTokens()) {
            String nextLine = readLine();
            if (nextLine == null) return null;
            tok = new StringTokenizer(nextLine);
        }

        return tok.nextToken();
    }

    private int readInt() {
        return Integer.parseInt(readString());
    }

    private long readLong() {
        return Long.parseLong(readString());
    }
}
