#include <bits/stdc++.h>
using namespace std;
 
vector<int>selectionSort(vector<int>&a){
int n = a.size();
	for(int i =0 ;i < n ;i++){
		int minInd=i;
		for(int j = i+1 ; j< n ;j++){
			if(a[minInd]>a[j]){
				minInd = j;
			}
		}
		if(minInd!= i){
			swap(a[minInd],a[i]);
		}
	}
	return a;
}
int main() {
   int n;cin>>n;
 
   vector<int>a(n);
   for(int i = 0;i<n ;i++){
     cin>>a[i];	
   }
 
   vector<int>ans = selectionSort(a);
   for(int &x:ans)cout<<x<<endl;
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7Cgp2ZWN0b3I8aW50PnNlbGVjdGlvblNvcnQodmVjdG9yPGludD4mYSl7CmludCBuID0gYS5zaXplKCk7Cglmb3IoaW50IGkgPTAgO2kgPCBuIDtpKyspewoJCWludCBtaW5JbmQ9aTsKCQlmb3IoaW50IGogPSBpKzEgOyBqPCBuIDtqKyspewoJCQlpZihhW21pbkluZF0+YVtqXSl7CgkJCQltaW5JbmQgPSBqOwoJCQl9CgkJfQoJCWlmKG1pbkluZCE9IGkpewoJCQlzd2FwKGFbbWluSW5kXSxhW2ldKTsKCQl9Cgl9CglyZXR1cm4gYTsKfQppbnQgbWFpbigpIHsKICAgaW50IG47Y2luPj5uOwogICAKICAgdmVjdG9yPGludD5hKG4pOwogICBmb3IoaW50IGkgPSAwO2k8biA7aSsrKXsKICAgICBjaW4+PmFbaV07CQogICB9CiAgIAogICB2ZWN0b3I8aW50PmFucyA9IHNlbGVjdGlvblNvcnQoYSk7CiAgIGZvcihpbnQgJng6YW5zKWNvdXQ8PHg8PGVuZGw7CglyZXR1cm4gMDsKfQ==

NgoxIDYgNCA5IDMgNA==

6
1 6 4 9 3 4