#include<bits/stdc++.h>
using namespace std;
int n;
int a[110000],b[110000];
int len;
int tot;
inline int read()
{
	register int x=0,y=1;
	register char c=getchar();
	while (c<'0'||c>'9')
	{
		if (c=='-')
		{
			y=-1;
		}
		c=getchar();
	}
	while (c>='0'&&c<='9')
	{
		x=x*10+c-'0';
		c=getchar();
	}
	return x*y;
}
struct q{
	int x,y,sum;
}t[110000];
void put(int x,int y)
{
	len++;
	t[len].x=x;
	t[len].y=y;
	t[len].sum=a[x]+b[y];
	int son=len;
	while (son>1)
	{
		int fa=son/2;
		if (t[son].sum>=t[fa].sum)
		{
			return;
		}
		else swap(t[son],t[fa]);
		son=fa;
	}
}
int get()
{
	int x=t[1].x;
	int y=t[1].y;
	cout<<t[1].sum<<" ";
	t[1]=t[len];
	len--;
	int fa=1;
	while (fa*2<=len)
	{
		int son=fa*2;
		if (son+1<=len&&t[son].sum>t[son+1].sum)
		{
			son++;
		}
		if (t[son].sum>=t[fa].sum)
		{
			break;
		}
		else swap(t[son],t[fa]);
		fa=son;
	}
	put(x,y+1);
}
int main()
{
 	n=read();
	for (int i=1;i<=n;i++)
	{
  		a[i]=read();
	}
	for (int i=1;i<=n;i++)
	{
  		b[i]=read();
	}
	for (int i=1;i<=n;i++)
	{
		put(i,1);
	}
	for (int i=1;i<=n;i++)
	{
		get();
	}
	return 0;
}