#include<bits/stdc++.h>
using namespace std;
#define int long long
priority_queue<int,vector<int>,greater<int> >q;
priority_queue<int,vector<int>,greater<int> >p;
int n;
signed main()
{
	cin>>n;
	for(int i=1;i<=n;++i)
	{
		int x;
		cin>>x;
		q.push(x);
	}
	for(int i=1;i<=n;++i)
	{
		int x;
		cin>>x;
		p.push(x);
	}
	priority_queue<int,vector<int>,greater<int> >r;
	int m = n / 2;
	int* a = new int[m]; 
	int* b = new int[m];
	
	for(int i=0;i<m;++i)
	{
		a[i] = q.top();
		q.pop();
		b[i] = p.top();
		p.pop();
	}
	for(int i=0;i<m;++i)
		for(int j=0;j<m;++j)
			r.push(a[i] + b[j]);
	
	delete[] a;
	delete[] b;
	
	for(int i=1;i<=n;++i)
	{
		cout<<r.top()<<" ";
		r.pop();
	}
	
	return 0;
}