// Bubble sort
// best case O(n), worst case O(n^2)
#include <iostream>
#include <fstream>
using namespace std;

ifstream f("algsort.in");
ofstream g("algsort.out");

void bubble(int arr[], int n){
  for(int i=0; i < n; ++i)
    for(int j=0; j < n - i; ++j)
      if(arr[j]>arr[j+1]){
        int aux = arr[j];
        arr[j] = arr[j+1];
        arr[j+1] = aux;
    }
}
int main(){
  int n;
  f>>n;

  int v[n];
  for(int i=0; i<n; ++i)
    f>>v[i];

  bubble(v,n);

  for(int i=0; i<n; ++i)
    g<<v[i]<<" ";

   return 0;
}