// Instead of saving successors or predecessors to allow recovering
// a connecting path, this version saves the (column) vertex providing
// the transitivity.  Recovering the path is done recursively.

#include <stdio.h>

#define NOTCONNECTED (-1)
#define DIRECT (-2)

void printIntermediate(int col[10][10],int i,int j)
// "Inorder" traversal of tree that gives a path.
{
if (col[i][j]==DIRECT)
  return;
printIntermediate(col,i,col[i][j]);
printf("%d ",col[i][j]);
printIntermediate(col,col[i][j],j);
}

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

scanf("%d",&n);
for (i=0;i<n;i++)
  for (j=0;j<n;j++)
    col[i][j]=NOTCONNECTED;
while (1)
{
  scanf("%d %d",&i,&j);
  if (i==(-1))
    break;
  col[i][j]=DIRECT;
}
for (i=0;i<n;i++)
{
  for (k=0;k<n;k++)
    printf("%3d ",col[i][k]);
  printf("\n");
}
printf("-------------------------------\n");
/* Warshall */
for (j=0;j<n;j++)
{
  for (i=0;i<n;i++)
    if (col[i][j]!=NOTCONNECTED)
      for (k=0;k<n;k++)
        if (col[i][k]==NOTCONNECTED && col[j][k]!=NOTCONNECTED)
          col[i][k]=j;
  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 ",col[i][k]);
    printf("\n");
  }
  printf("-------------------------------\n");
}
for (i=0;i<n;i++)
  for (j=0;j<n;j++)
    if (col[i][j]==NOTCONNECTED)
      printf("No path from %d to %d\n",i,j);
    else
    {
      printf("Path %d ",i);
      printIntermediate(col,i,j);
      printf("%d\n",j);
    }
}