dfsgfdfgdfgdfgrt

#include<iostream>
using namespace std;
const int N=100001;
int n,a[N];
void Bubble_sort()
{
    for(int i=1;i<=n-1;++i)
    {
        for(int j=1;j<=n-i;++j)
        {
            if(a[j]>a[j+1]) swap(a[j],a[j+1]);
        }
    }
}
int main(){
    
    cin >> n;
    for(int i=1;i<=n;++i) cin>>a[i];
    Bubble_sort();
    for(int i=1;i<=n;++i) cout<<a[i]<<" ";
    return 0;
}