#include <stdio.h>

int main(void)
{
  int largest[10]; /* the ten largest integers seen so far, in some order */
  int s;
  int n;
  int i;

  for (i = 0;i < 10;++i) {
    if (scanf("%d",&n) < 1) {
      while (i > 0) {
        --i;
        printf("%d\n",largest[i]);
      }
      return 0;
    }
    largest[i] = n;
  }

  while (scanf("%d",&n) == 1) {
    s = largest[0];
    for (i = 1;i < 10;++i)
      if (largest[i] < s)
        s = largest[i];
    /* s is the smallest of largest[0], largest[1], ..., largest[9] */

    if (n > s) /* kick out the smallest, replace it with n */
      for (i = 0;i < 10;++i)
        if (largest[i] == s) {
          largest[i] = n;
          break;
        }
  }

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

  return 0;
}