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