// Warshall's algorithm with predecessors

#include <stdio.h>

main()
{
int pred[10][10],n,i,j,k;

scanf("%d",&n);
for (i=0;i<n;i++)
  for (j=0;j<n;j++)
    pred[i][j]=(-1);
while (1)
{
  scanf("%d %d",&i,&j);
  if (i==(-1))
    break;
  pred[i][j]=i;
}
printf("    ");
for (i=0;i<n;i++)
  printf("%3d ",i);
printf("\n");
for (i=0;i<n;i++)
{
  printf("%3d ",i);
  for (k=0;k<n;k++)
    printf("%3d ",pred[i][k]);
  printf("\n");
}
printf("-------------------------------\n");
/* Warshall */
for (j=0;j<n;j++)
{
  for (i=0;i<n;i++)
    if (pred[i][j]!=(-1))
      for (k=0;k<n;k++)
        if (pred[i][k]==(-1) && pred[j][k]!=(-1))
          pred[i][k]=pred[j][k];
  printf("    ");
  for (i=0;i<n;i++)
    printf("%3d ",i);
  printf("\n");
  for (i=0;i<n;i++)
  {
    printf("%3d ",i);
    for (k=0;k<n;k++)
      printf("%3d ",pred[i][k]);
    printf("\n");
  }
  printf("-------------------------------\n");
}
for (i=0;i<n;i++)
  for (j=0;j<n;j++)
    if (pred[i][j]==(-1))
      printf("No path from %d to %d\n",i,j);
    else
    {
      printf("Reverse of path %d ",j);
      for (k=pred[i][j];
           k!=i;
           k=pred[i][k])
        printf("%d ",k);
      printf("%d\n",i);
    }
}