#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;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2ZWN0b3I8aW50Pmluc2VydGlvblNvcnQodmVjdG9yPGludD4mbnVtcyl7CmludCBuID0gbnVtcy5zaXplKCk7Cglmb3IoaW50IGkgPTEgO2kgPCBuIDtpKyspewoJCWludCBrZXkgPSBudW1zW2ldOwoJCWludCBqID0gaS0xOwoJd2hpbGUoaj49MCAmJiBudW1zW2pdPmtleSl7CgkgICBudW1zW2orMV09bnVtc1tqXTtqLS07fQogCSAgIG51bXNbaisxXT1rZXk7Cgl9CglyZXR1cm4gbnVtczsKfQppbnQgbWFpbigpIHsKICAgaW50IG47Y2luPj5uOwogICAKICAgdmVjdG9yPGludD5hKG4pOwogICBmb3IoaW50IGkgPSAwO2k8biA7aSsrKXsKICAgICBjaW4+PmFbaV07CQogICB9CiAgIAogICB2ZWN0b3I8aW50PmFucyA9IGluc2VydGlvblNvcnQoYSk7CiAgIGZvcihpbnQgJng6YW5zKWNvdXQ8PHg8PGVuZGw7CglyZXR1cm4gMDsKfQ==

NAoyIDMgNCAx

4
2 3 4 1