#include <bits/stdc++.h>
using namespace std;
 
vector<int>bubbleSort(vector<int>&nums){
int n = nums.size();
	for(int i = n-1 ;i >=0 ;i--){
		bool didSwap = false;
	for(int j = 0 ; j< i ;j++){
		if(nums[j]>nums[j+1]){
			swap(nums[j],nums[j+1]);
			didSwap = true;
		}
	}
	if(!didSwap){
		break;
	}
	}
	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 = bubbleSort(a);
   for(int &x:ans)cout<<x<<endl;
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2ZWN0b3I8aW50PmJ1YmJsZVNvcnQodmVjdG9yPGludD4mbnVtcyl7CmludCBuID0gbnVtcy5zaXplKCk7Cglmb3IoaW50IGkgPSBuLTEgO2kgPj0wIDtpLS0pewoJCWJvb2wgZGlkU3dhcCA9IGZhbHNlOwoJZm9yKGludCBqID0gMCA7IGo8IGkgO2orKyl7CgkJaWYobnVtc1tqXT5udW1zW2orMV0pewoJCQlzd2FwKG51bXNbal0sbnVtc1tqKzFdKTsKCQkJZGlkU3dhcCA9IHRydWU7CgkJfQoJfQoJaWYoIWRpZFN3YXApewoJCWJyZWFrOwoJfQoJfQoJcmV0dXJuIG51bXM7Cn0KaW50IG1haW4oKSB7CiAgIGludCBuO2Npbj4+bjsKICAgCiAgIHZlY3RvcjxpbnQ+YShuKTsKICAgZm9yKGludCBpID0gMDtpPG4gO2krKyl7CiAgICAgY2luPj5hW2ldOwkKICAgfQogICAKICAgdmVjdG9yPGludD5hbnMgPSBidWJibGVTb3J0KGEpOwogICBmb3IoaW50ICZ4OmFucyljb3V0PDx4PDxlbmRsOwoJcmV0dXJuIDA7Cn0=

NAoxIDQgMyAy

4
1 4 3 2