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.*;
import java.util.function.BiFunction;
import java.util.function.Function;
import java.util.stream.Collectors;
import java.util.stream.Stream;

public class Main implements Runnable {
    static final int MOD = (int) 1e9 + 7;
    static final int MI = (int) 1e9;
    static final long ML = (long) 1e18;
    static final Reader in = new Reader();
    static final PrintWriter out = new PrintWriter(System.out);
    StringBuilder answer = new StringBuilder();

    public static void main(String[] args) {
        new Thread(null, new Main(), "persefone", 1l << 32).start();
    }

    @Override
    public void run() {
        solve();
        printf();
        flush();
    }

    void solve() {
        int n = in.nextInt();
        int[] a = in.nextIntArray(n);
        int[] b = in.nextIntArray(n);
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for (int v : b) {
            map.put(v, map.getOrDefault(v, 0) + 1);
        }
        int[] c = new int[n];
        for (int i = 0; i < n; i++) {
            if (i == n - 1) {
                c[i] = (map.firstKey() + a[i]) % n;
                break;
            }
            Map.Entry<Integer, Integer> lowest = map.firstEntry();

            Map.Entry<Integer, Integer> low = map.ceilingEntry((n - a[i] % n) % n);
            if (low == null || (low.getKey() + a[i]) % n > (lowest.getKey() + a[i]) % n) {
                c[i] = (lowest.getKey() + a[i]) % n;
                if (lowest.getValue() == 1) {
                    map.remove(lowest.getKey());
                } else {
                    map.put(lowest.getKey(), lowest.getValue() - 1);
                }
            } else {
                c[i] = (low.getKey() + a[i]) % n;
                if (low.getValue() == 1) {
                    map.remove(low.getKey());
                } else {
                    map.put(low.getKey(), low.getValue() - 1);
                }
            }
        }
        printf(c);
    }

    static class Graph {
        private int vertices;
        private List<Integer>[] adjacencies;
        private List<Integer> topo;
        private int[] dp;
        private int[] color;

        private boolean hasCycle;

        public Graph(int vertices) {
            this.vertices = vertices;
            this.adjacencies = Stream.generate(ArrayList::new).limit(vertices).toArray(List[]::new);
            this.topo = new ArrayList<>();
            this.color = new int[vertices];
            this.dp = new int[vertices];
        }

        public void addEdge(int from, int to) {
            adjacencies[from].add(to);
        }

        public void normalDfs(int from) {
            color[from] = 1;
            for (int to : adjacencies[from]) {
                if (color[to] == 0) {
                    normalDfs(to);
                }
            }
        }

        public void mainDfs(int from) {
            color[from] = 1;
            for (int to : adjacencies[from]) {
                if (color[to] == 0) {
                    mainDfs(to);
                } else if (color[to] == 1) {
                    hasCycle = true;
                    break;
                }
            }
            color[from] = 2;
            topo.add(from);
        }

        public void topoSort(int from) {
            mainDfs(from);
            Collections.reverse(topo);
        }

        public void topoSort() {
            for (int from = 0; from < vertices; from++) {
                if (color[from] == 0) {
                    mainDfs(from);
                }
            }
            Collections.reverse(topo);
        }

        public void resetColor() {
            Arrays.fill(color, 0);
        }

    }


    void printf() {
        out.print(answer);
    }

    void close() {
        out.close();
    }

    void flush() {
        out.flush();
    }

    void printf(Stream<?> str) {
        str.forEach(o -> add(o, " "));
        add("\n");
    }


    void printf(Object... obj) {
        printf(false, obj);
    }

    void printfWithDescription(Object... obj) {
        printf(true, obj);
    }


    private void printf(boolean b, Object... obj) {

        if (obj.length > 1) {
            for (int i = 0; i < obj.length; i++) {
                if (b) add(obj[i].getClass().getSimpleName(), " - ");
                if (obj[i] instanceof Collection<?>) {
                    printf((Collection<?>) obj[i]);
                } else if (obj[i] instanceof int[][]) {
                    printf((int[][]) obj[i]);
                } else if (obj[i] instanceof long[][]) {
                    printf((long[][]) obj[i]);
                } else if (obj[i] instanceof double[][]) {
                    printf((double[][]) obj[i]);
                } else printf(obj[i]);
            }
            return;
        }

        if (b) add(obj[0].getClass().getSimpleName(), " - ");
        printf(obj[0]);
    }

    void printf(Object o) {
        if (o instanceof int[])
            printf(Arrays.stream((int[]) o).boxed());
        else if (o instanceof char[])
            printf(new String((char[]) o));
        else if (o instanceof long[])
            printf(Arrays.stream((long[]) o).boxed());
        else if (o instanceof double[])
            printf(Arrays.stream((double[]) o).boxed());
        else if (o instanceof boolean[]) {
            for (boolean b : (boolean[]) o) add(b, " ");
            add("\n");
        } else
            add(o, "\n");
    }

    void printf(int[]... obj) {
        for (int i = 0; i < obj.length; i++) printf(obj[i]);
    }

    void printf(long[]... obj) {
        for (int i = 0; i < obj.length; i++) printf(obj[i]);
    }

    void printf(double[]... obj) {
        for (int i = 0; i < obj.length; i++) printf(obj[i]);
    }

    void printf(boolean[]... obj) {
        for (int i = 0; i < obj.length; i++) printf(obj[i]);
    }

    void printf(Collection<?> col) {
        printf(col.stream());
    }

    <T, K> void add(T t, K k) {
        if (t instanceof Collection<?>) {
            ((Collection<?>) t).forEach(i -> add(i, " "));
        } else if (t instanceof Object[]) {
            Arrays.stream((Object[]) t).forEach(i -> add(i, " "));
        } else
            add(t);
        add(k);
    }


    <T> void add(T t) {
        answer.append(t);
    }

    static class Reader {
        private BufferedReader br;
        private StringTokenizer st;

        Reader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        Reader(String fileName) throws FileNotFoundException {
            br = new BufferedReader(new FileReader(fileName));
        }

        boolean isReady() throws IOException {
            return br.ready();
        }

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

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

        int[] nextIntArray(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++)
                arr[i] = nextInt();
            return arr;
        }

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

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

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