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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.util.TreeMap;

public class D {

	public static void main(String[] args) {
		FastReader scan = new FastReader();
		int n = scan.nextInt();
		PrintWriter out = new PrintWriter(System.out);
		TreeMap<Integer, Integer> b = new TreeMap<>();
		int[] a = new int[n];
		for(int j = 0; j < n; j++) a[j] = scan.nextInt();
		for(int i = 0; i < n; i++) {
			int c = scan.nextInt();
			b.put(c, b.getOrDefault(c, 0)+1);
		}
		int index = 0;
		while(index < n) {
			if(a[index] == 0) {
				int get = b.ceilingKey(0);
				out.print(get + " ");
				b.put(get, b.get(get) - 1);
				if(b.get(get) == 0) b.remove(new Integer(get));
			}
			else {
				int need = n - a[index];;
				Integer aa = b.firstKey(), bb = b.ceilingKey(need);
				if((aa == null && bb != null) || (bb != null && (a[index]+bb)%n < (a[index]+aa)%n)) {
					int curr = (a[index]+bb)%n;
					out.print(curr + " ");
					b.put(bb, b.get(bb) - 1);
					if(b.get(bb) == 0) b.remove(new Integer(bb));
				}
				else {
					int curr = (a[index]+aa)%n;
					out.print(curr + " ");
					b.put(aa, b.get(aa) - 1);
					if(b.get(aa) == 0) b.remove(new Integer(aa));
				}
				//out.println(aa + " " + bb);
			}
			index++;
		}
		out.close();
	}
	
	static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(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; 
        } 
    }

}
