#include <iostream>
#include <fstream>
#include <stack>

using namespace std;

int visited[10], matrix[10][10],n;

void DFS(int i)
{
    int j;
    printf("\n%d",i);
    visited[i]=1;
    for(j=1;j<n+1;j++)
       {if((visited[j]==0)&&(matrix[i][j]==1))
            DFS(j);
            }
}

int main()
{
int p;
int q;
int x;
int y;
int i;
ifstream f;
f.open("file.txt");
    f>>n;
    int matrix[n][n];
    for(x=1;x<n+1;x++){
        for(y=1;y<n+1;y++){
            matrix[x][y]=0;
        }
    }
    printf("Number of vertices is %d \n", n);
    while(!f.eof()){
            f>>p>>q;
            matrix[p][q]=1;

    }
    for(x = 1 ; x < n+1 ; x++) {
        printf(" (");
        for(y = 1 ; y < n+1 ; y++){
            printf("%d     ", matrix[x][y]);
        }
        printf(")\n");
    }

    DFS(1);
    //printf("%d \n",visited[4]);
    printf("\n");
    for(i=1;i<n+1;i++)
        {if(visited[i]==1) printf("%d \n", i);
        else
            printf("NU \n");
        }
    f.close();
    return 0;

    }