#include <iostream>
#include <fstream>

using namespace std;


int get_pivot_index(int vect[], int first, int last)
{
    return first;
}

void quick_sort(int vect[], int first, int last)
{
    if (first >= last)
        return;
    int pivot_index = get_pivot_index(vect, first, last);
    int pivot_value = vect[pivot_index];
    int start = first;
    int value;

    while (start <= last)
    {
        value = vect[start];
        if (value < pivot_value)
        {
            int aux = vect[pivot_index];
            vect[pivot_index] = vect[start];
            vect[start] = vect[pivot_index+1];
            vect[pivot_index+1] = aux;
            ++pivot_index;
        }
        ++start;
    }
    quick_sort(vect, first, pivot_index - 1);
    quick_sort(vect, pivot_index + 1, last);
}

void quickSort(int arr[], int left, int right) {
      int i = left, j = right;
      int tmp;
      int pivot = arr[(left + right) / 2];

      /* partition */
      while (i <= j) {
            while (arr[i] < pivot)
                  i++;
            while (arr[j] > pivot)
                  j--;
            if (i <= j) {
                  tmp = arr[i];
                  arr[i] = arr[j];
                  arr[j] = tmp;
                  i++;
                  j--;
            }
      };

      /* recursion */
      if (left < j)
            quickSort(arr, left, j);
      if (i < right)
            quickSort(arr, i, right);
}

int main()
{
    ifstream cin("algsort.in");
    ofstream cout("algsort.out");

    int n, index, aux_var;
    cin >> n;
    int numbers[n];

    for (index = 0; index < n; ++index)
    {
        cin >> numbers[index];
    }

    //quick_sort(numbers, 0, n-1);
    quickSort(numbers, 0, n-1);

    for (int i = 0; i < n; ++i)
    {
        cout << numbers[i] << ' ';
    }
    cout << "\n";
    return 0;
}