/*! A program that reads integers, sorts them, and prints them out */

#include <stdlib.h>
#include <iostream>

inline int cmp(const void * a, const void * b)
{
  int aa = *(int *)a;
  int bb = *(int *)b;
  return (aa < bb) ? -1 : (aa > bb) ? 1 : 0;
}
 
int main(int argc, char * argv[])
{
  const int size = 1000;
  int array[size];
  int n = 0;
  while (std::cin >> array[n++]);
  n--;          // it got incremented once too many times
  qsort(array, n, sizeof(int), cmp);
  for (int i = 0; i < n; ++i)
    std::cout << array[i] << std::endl;
  return 0;
}