#include <bits/stdc++.h>
using namespace std;

vector<int>insertionSort(vector<int>&nums){
int n = nums.size();
	for(int i =1 ;i < n ;i++){
		int key = nums[i];
		int j = i-1;
	while(j>=0 && nums[j]>key){
	   nums[j+1]=nums[j];j--;}
 	   nums[j+1]=key;
	}
	return nums;
}
int main() {
   int n;cin>>n;
   
   vector<int>a(n);
   for(int i = 0;i<n ;i++){
     cin>>a[i];	
   }
   
   vector<int>ans = insertionSort(a);
   for(int &x:ans)cout<<x<<endl;
	return 0;
}