#include <stdio.h>

#define MAX_QUEUE_CAPACITY     15
#define BINGO_SEQUENCE_LENGTH  5
#define RESET_VALUE            -1

struct queue
{
   int currentQueueSize;
   int queueFrontIndex;
   int queueRearIndex;
   int currentQueueItems[ MAX_QUEUE_CAPACITY ];
};

struct queue numbers;  /* Queue currently in use by program */

void enqueue( int );  /* Adds a number to the rear of the queue */
int  dequeue();  /* Removes a number from the front of the queue */
int  front();  /* Look at the number currently at the front of the queue */
int  size();  /* Count the items currently in the queue */

int main( void )
{
   int input, bingoNumber, bingoCounter;

   do
   {
      if ( scanf( "%d", &input ) < 1 )  break;

      /* Check for reset command before any other processing */
      if ( input == RESET_VALUE )
      {
         /* Empty queue */
         while ( size() > 0 ) dequeue();
   
         /* Reset bingo counter */
         bingoNumber = input;
         bingoCounter = 1;
   
         /* Go to next input number */
         continue;
      }

      /* Add positive numbers to the queue */
      if ( input > 0 )
      {
         enqueue( input );
   
         if ( bingoNumber == input )
         {
            /* Increment bingo counter */
            bingoCounter++;
         }
         else
         {
            /* Reset bingo counter */
            bingoNumber = input;
            bingoCounter = 1;
         }
      }

      /* Remove a number when the input is zero */
      if ( input == 0 )
      {
         dequeue();
   
         /* Always reset bingo counter when a number is removed */
         bingoNumber = input;
         bingoCounter = 1;
      }

      /* Check for winning condition */
      if ( bingoCounter == BINGO_SEQUENCE_LENGTH )
      {
         printf( "Bingo!" );

         /* Jump out of loop */
         break;
      }

      /* The while loop repeats as long as the value is positive, zero or -1 */
   } while ( input >= -1 );

   /* Displays all numbers in the queue, except when the winning condition is found */
   while ( ( bingoCounter != BINGO_SEQUENCE_LENGTH ) && ( size() > 0 ) )
      printf( "%d ", dequeue() );
}

void enqueue( int item )
{
   /* Do not add if the queue is full */
   if ( numbers.currentQueueSize >= MAX_QUEUE_CAPACITY ) return;

   /* Add new item and increment queue size counter */
   numbers.currentQueueItems[ numbers.queueRearIndex ] = item;
   numbers.currentQueueSize++;

   /* Move the rear index to the right and wraparound if end of the array is reached */
   numbers.queueRearIndex++;
   if ( numbers.queueRearIndex >= MAX_QUEUE_CAPACITY ) numbers.queueRearIndex = numbers.queueRearIndex - MAX_QUEUE_CAPACITY;
}

int dequeue()
{
   int item;

   /* Nothing to return if the queue is empty */
   if ( numbers.currentQueueSize < 1 ) return item;

   /* Return the item at the front position and decrement the queue size counter */
   item = numbers.currentQueueItems[ numbers.queueFrontIndex ];
   numbers.currentQueueSize--;

   /* Move the front index to the right and wraparound if the end of the array is reached */
   numbers.queueFrontIndex++;
   if ( numbers.queueFrontIndex >= MAX_QUEUE_CAPACITY ) numbers.queueFrontIndex = numbers.queueFrontIndex - MAX_QUEUE_CAPACITY;
   return item;
}

int front()
{
   int item;

   /* Return the front item only if there is at least one item in the queue */
   if ( numbers.currentQueueSize > 0 )
      item = numbers.currentQueueItems[ numbers.queueFrontIndex ];

   return item;
}

int size()
{
   return numbers.currentQueueSize;
}