#include<bits/stdc++.h>
using namespace std;
void Bubblesort(int a[],int n)
{
int flag=0;
for(int i=0;i<n-1;i++)// for passes
{
flag=0;//make flag zero before entering any pass
for(int j=0;j<n-1-i;j++)//in every pass one comparison should reduce so n-1-i
{
if(a[j]>a[j+1])
{
swap(a[j],a[j+1]);
flag=1;
}
}
if(flag==0)break;
}
}
int main()
{
int n;
cin>>n;
int ar[n+3];
for(int i=0;i<n;i++)
{
cin>>ar[i];
}
Bubblesort(ar,n);
for(int i=0;i<n;i++)
{
cout<<ar[i]<<" ";
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCnZvaWQgQnViYmxlc29ydChpbnQgYVtdLGludCBuKQp7CiAgIGludCBmbGFnPTA7CiAgIGZvcihpbnQgaT0wO2k8bi0xO2krKykvLyBmb3IgcGFzc2VzCiAgIHsKICAgICAgICBmbGFnPTA7Ly9tYWtlIGZsYWcgemVybyBiZWZvcmUgZW50ZXJpbmcgYW55IHBhc3MKICAgICAgICBmb3IoaW50IGo9MDtqPG4tMS1pO2orKykvL2luIGV2ZXJ5IHBhc3Mgb25lIGNvbXBhcmlzb24gc2hvdWxkIHJlZHVjZSBzbyBuLTEtaQogICAgICAgICAgewogICAgICAgICAgICBpZihhW2pdPmFbaisxXSkKICAgICAgICAgICAgewogICAgICAgICAgICAgICBzd2FwKGFbal0sYVtqKzFdKTsKICAgICAgICAgICAgICAgZmxhZz0xOwogICAgICAgICAgICB9CiAgICAgICAgICB9CiAgICAgICAgICBpZihmbGFnPT0wKWJyZWFrOwogICB9Cgp9CgoKCmludCBtYWluKCkKewogICBpbnQgbjsKICAgY2luPj5uOwogICBpbnQgYXJbbiszXTsKICAgZm9yKGludCBpPTA7aTxuO2krKykKICAgewogICAgICBjaW4+PmFyW2ldOwogICB9CiBCdWJibGVzb3J0KGFyLG4pOwogZm9yKGludCBpPTA7aTxuO2krKykKIHsKICAgY291dDw8YXJbaV08PCIgIjsKIH0KCn0=