#include<bits/stdc++.h>

using namespace std;

int n, a[1000];

int main() {
    ifstream cin("algsort.in");
    ofstream cout("algsort.out");
    cin>>n;
    for (int i=0; i<n; i++) cin>>a[i];


    for (int i=0; i<n-1; i++) {
        // last i elements are already in place
        for (int j=0; j<n-i-1; j++)
            if (a[j] > a[j+1]) {
                swap(a[j+1], a[j]);
            }
    }

    for (int i=0; i<n; i++) cout<<a[i]<<" ";


    return 0;
}