import java.util.Scanner;

import javax.management.RuntimeErrorException;


public class Naloga3 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        String orientation = "directed";
        String action = "walks";
        String parameter = "Jure";
        int count = 0;

        if (orientation.equals("directed")){
            while (scanner.hasNextLine()) {
                int number = scanner.nextInt();
                int nmb2 = number;
                int[][] matrix = new int[number][number];
                while(2*number >= 0){
                    int nmb = scanner.nextInt();
                    int nmbj = scanner.nextInt();
                    matrix[nmb][nmbj] = 1;
                    number--;

                }
                /*String string = null;
                for (int i = 0; i < matrix.length; i++) {
                    for (int j = 0; j < matrix[i].length; j++) {
                        string+= matrix[i][j];
                    }
                    System.out.print(string);
                }*/

                for (int i = 0; i < nmb2; i++){
                    for (int j = 0; j < nmb2; j++){
                        System.out.print(matrix[i][j]+ " ");
                    }
                    System.out.println();
                }



                runCommand( action, parameter, matrix);
            }
        }
        else {
            while (scanner.hasNextLine()) {
                int number = scanner.nextInt();
                int[][] matrix = new int[number][number];
                while(2*number >= 0){
                    int nmb = scanner.nextInt();
                    int nmbj = scanner.nextInt();
                    matrix[nmb][nmbj] = 1;
                    matrix[nmbj][nmb] = 1;
                    number--;

                }
                /*String string = null;
                for (int i = 0; i < matrix.length; i++) {
                    for (int j = 0; j < matrix[i].length; j++) {
                        string+= matrix[i][j];
                    }
                    System.out.print(string);
                }*/

                for (int i = 0; i < number; i++){
                    for (int j = 0; j < number; j++){
                        System.out.print(matrix[i][j]+ " ");
                    }
                    System.out.println();
                }

                runCommand( action, parameter, matrix);
            }
        }





        scanner.close();


    }

    static void runCommand( String action, String parameter ,int[][] matrix){
        if (action.equals("walks")){
            walks(matrix, 3);
        }
    }

    static void KPaths(int graph[][], int k){
        int count = 0;
        for (int i = 0; i < graph.length; i++) {
            for (int j = 0; j < graph.length; j++){
                int nmb = i*k;
                int nmb2 = j*k;
                graph[i][j] = graph[nmb][nmb2];
            }
        }
        for (int i = 0; i < graph.length; i++){
            for (int j = 0; j < graph.length; j++){
                System.out.print(graph[i][j]+ " ");
            }
            System.out.println();
        }


    }

    @SuppressWarnings("null")
    static int[][] walks(int[][] graph, int k){
        int[][] copy = new int[3][3];
        for (int i = 0; i < 3; i++) {
            for (int j = 0; j < 3; j++) {
                copy[i][j] = graph[i][j];
            }
        }
        int m1 = graph.length;
        int n1 =graph[0].length;
        int m2 = copy.length;
        int n2 = copy[0].length;
        if(n1 != m2){
            throw new RuntimeErrorException(null, "nekaj");
        }
        int[][] newOne = new int[6][6];
        for (int i = 0; i < m1; i++) {
            for (int j = 0; j < n2; j++) {
                for (int j2 = 0; j2 < n1; j2++) {
                    newOne[i][j] += graph[i][k]*copy[k][j];
                }
            }
        }
        return newOne;
    }


}