/*
This is a different solution to sample2-2.txt.
*/

#include <stdio.h>

int main(void)
{
  int numlargest = 0; /* at most 10 */
  int largest[10]; /* [0],[1],...,[numlargest-1] are in decreasing order */
  int n;
  int i;
  int j;

  while (scanf("%d",&n) == 1) {
    for (i = 0;i < numlargest;++i)
      if (n > largest[i])
        break;
    if (i == 10)
      continue;
    if (numlargest < 10)
      ++numlargest;
    for (j = numlargest - 1;j > i;--j)
      largest[j] = largest[j - 1];
    largest[i] = n;
  }

  for (i = 0;i < numlargest;++i)
    printf("%d\n",largest[i]);

  return 0;
}