using System;
using System.Collections.Generic;
using System.Linq;



namespace QuickSort
{
    class Program
    {
        static void Main(string[] args)
        {
            List<int> input = Console.ReadLine().Split(" ", StringSplitOptions.RemoveEmptyEntries).Select(int.Parse)
                .ToList();
            input = Quicksort(input);
            Console.WriteLine(string.Join(" ", input));
        }

        public static List<T> Quicksort<T>(List<T> list) where T : IComparable
        {

            if (list.Count <= 1)
            {
                return list;
            }
            T pivot = list[0];
            List<T> leftArray = new List<T>();
            List<T> righArray = new List<T>();
            for (int i = 0; i < list.Count; i++)
            {
                if (list[i].CompareTo(pivot) < 0)
                {
                    leftArray.Add(list[i]);
                }
                else if (list[i].CompareTo(pivot) > 0)
                {
                    righArray.Add(list[i]);
                }
            }

            leftArray = Quicksort(leftArray);
            righArray = Quicksort(righArray);
            leftArray.Add(pivot);
            leftArray.AddRange(righArray);
            return leftArray;
        }
    }
}