#include <iostream>
#include <stdlib.h>
#include <fstream>
using namespace std;

int x[10000];


int compareMyType ( int a,  int b)
{
  if (  a < b ) return -1;
  if (a == b ) return 0;
  if ( a > b ) return 1;
}







int main()
{

    ifstream fin ("radixsort.in");
    ofstream fout("radixsort.out");

  int i;

    for(i=1;i<=1000;i++)
        fin>>x[i];

    qsort (x, 1001, sizeof(int), compareMyType);


    for(i=1;i<=1000;i++)
            fout<<x[i]<<" ";


    return 0;
}