#include<bits/stdc++.h> using namespace std; priority_queue<int,vector<int>,greater<int> >q; int main(){ int n; cin>>n; for(int i=1;i<=n;i++) {int x;cin>>x;q.push(x);} int x; cin>>x; q.push(x); for(int i=1;i<=n+1;i++) {cout<<q.top()<<" ";q.pop();} return 0; }