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

/* Name of the class has to be "Main" only if the class is public. */
public class Main
{
     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;
        }
    }
 static long gcd(long a, long b) 
    { 
      if (b == 0) 
        return a; 
      return gcd(b, a % b);  
    } 
    public static void main(String[] args)
    {
        FastReader sc=new FastReader();
        int n = sc.nextInt();
        int a[]= new int[n];
        TreeSet<Integer> b= new TreeSet<Integer>();
        HashMap<Integer,Integer> h= new HashMap<>();
        int c[]=new int[n];
        for(int i=0;i<n;i++)
        a[i]= sc.nextInt();
        for(int i=0;i<n;i++)
		{
			int y=sc.nextInt();
           b.add(y);
       if(h.containsKey(y))
       h.put(y,h.get(y)+1);
       else
       h.put(y,1);
       }
      // System.out.println(b.pollFirst());
        for(int i=0;i<n;i++)
        {
        int m=(n-a[i])%n;
		 if(b.contains(m) && h.get(m)>0)
        {
			c[i]=0;
            int p= h.get(m);
            if(p==1)
			{
				b.remove(m);
				h.put(m,0);
			}
            else
				h.put(m,h.get(m)-1);
        }
        else
        {
            Integer upper=(Integer)b.higher(m);
			if(upper==null)
			{
				int lower=b.first();
				c[i]=(lower+a[i])%n;
				h.put(lower,h.get(lower)-1);
				if(h.get(lower)==0)
				{
					b.remove(lower);
				}
			}
			else
			{
				c[i]=(upper+a[i])%n;
				h.put(upper,h.get(upper)-1);
				if(h.get(upper)==0)
				{
					b.remove(upper);
				}
			}
        }
       }
        for(int i=0;i<n;i++)
        System.out.print(c[i]+" ");
     }
}