// zQredact.cpp

#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cassert>
 using namespace std;

 const int maxn = 100;
 const int start = 0;
 const int maxonline = 25;





 void nicewrite(int); // no more than maxonline on a line

 class queue
  {
   private:

    struct linkedlist{
      int datum;
      linkedlist*next;
     };

    linkedlist*dummy;

   public:
    void initialize()
     {
      dummy = new linkedlist;
      dummy->next = dummy;
      dummy->datum = -1;
     }

    bool empty()
     {

     }

    void enqueue(int newdatum)
     {





     }

    void traverse()
     {








     }

    int dequeue()
     {




     }
  };

    void nicewrite(int m)
     {








     }

 queue outneighbors[maxn]; // the graph stored as array of outneighbor lists
                           // stored as queues for convenience

  void skipspace()
   {
    while (cin && isspace(cin.peek())) cin.ignore();
   }

  void readedges()
   {
    int source;
    int target;
    while(cin.peek()!=EOF)
     {
      cin >> source >> target;

      skipspace();
     }
   }

 void getdigraph()
  {
   cin >> n;
   for (int i=0;i<n;i++)
    outneighbors[i].initialize();
   readedges();
  }

 void listoutneighbors()
  {
   for(int i = 0; i < n; i++)
    {
     cout << i << ": ";
     outneighbors[i].traverse();
    }
  }

 bool visited[maxn];

 void bfs()
  {
   queue bfslist;


   cout << "The Input Digraph has " << n << " vertices" << endl;
   cout<<"Array of Outneighbor Lists:" << endl;

   queue partprocessed;

   partprocessed.enqueue(start);

   visited[start] = true;
   while(!partprocessed.empty())
    {











    }
   cout << "Vertices Reachable from " << start << " in BFS Order:" << endl;
   bfslist.traverse();
  }

 void writeunvisited()
  {
   cout << "Unreachable Vertices: " << endl;
 



      nicewrite(i);


  }

 int main()
  {
   bfs();
   writeunvisited();
   return 0;
  }