P1631

#include<bits/stdc++.h>
const int maxn=100007;
using namespace std;
vector<int> A,B;
priority_queue<int,vector<int>,greater<int> > ans;
int main(){
    int n,a,b;
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>a;
        A.push_back(a);
    }
    for(int i=0;i<n;i++){
        cin>>b;
        B.push_back(b);
    }
    for(int i=0;i<n;i++){
        priority_queue<int,vector<int>,greater<int> > ass;
        for(int j=0;j<n;j++){
            ass.push(A[i]+B[j]);
        }
        ans.push(ass.top());
    }
    for(int i=0;i<n;i++) {
    	cout<<ans.top()<<" ";
    	ans.pop();
	}
    return 0;
}