#include <bits/stdc++.h>
using namespace std;
void StableSelectionSort(vector<int>&arr, int n)
{
for(int i=0;i<n-1;i++)
{
int minIndex = i;
for(int j=i+1;j<n;j++)
{
if(arr[j]<arr[minIndex])
{
minIndex = j;
}
}
if(minIndex!=i)
{
int k = minIndex;
while(k!=i )
{
swap(arr[k],arr[k-1]);
k--;
}
}
}
}
int main() {
// your code goes here
int n;
cin>>n;
vector<int> arr;
for(int i=0;i<n;i++)
{
int num;
cin>>num;
arr.push_back(num);
}
StableSelectionSort(arr,n);
for(int i=0;i<n;i++) cout<<arr[i]<<" ";
cout<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnZvaWQgU3RhYmxlU2VsZWN0aW9uU29ydCh2ZWN0b3I8aW50PiZhcnIsIGludCBuKQp7Cglmb3IoaW50IGk9MDtpPG4tMTtpKyspCgl7CgkJaW50IG1pbkluZGV4ID0gaTsKCQlmb3IoaW50IGo9aSsxO2o8bjtqKyspCgkJewoJCQlpZihhcnJbal08YXJyW21pbkluZGV4XSkKCQkJewoJCQkJbWluSW5kZXggPSBqOwoJCQl9CgkJfQoJCWlmKG1pbkluZGV4IT1pKQoJCXsKCQkJaW50IGsgPSBtaW5JbmRleDsKCQkJd2hpbGUoayE9aSApCgkJCXsKCQkJCXN3YXAoYXJyW2tdLGFycltrLTFdKTsKCQkJCWstLTsKCQkJfQoJCX0KCX0KfQppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuOwoJY2luPj5uOwoJdmVjdG9yPGludD4gYXJyOwoJZm9yKGludCBpPTA7aTxuO2krKykKCXsKCQlpbnQgbnVtOwoJCWNpbj4+bnVtOwoJCWFyci5wdXNoX2JhY2sobnVtKTsKCX0KCVN0YWJsZVNlbGVjdGlvblNvcnQoYXJyLG4pOwoJZm9yKGludCBpPTA7aTxuO2krKykgY291dDw8YXJyW2ldPDwiICI7Cgljb3V0PDxlbmRsOwoJcmV0dXJuIDA7Cn0=