import java.util.Arrays;
import java.util.Scanner;

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

        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;
                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);
            }*/

            System.out.println(Arrays.deepToString(matrix));
            runCommand(orientation, action, parameter, matrix);
        }


        scanner.close();


    }

    static void runCommand(String orientation, String action, String parameter ,int[][] matrix){

    }

    static int KPaths(int graph[][], int k){
        int count = 0;
        for (int i = 0; i < graph.length; i++) {
            if (graph[][])
        }
        return k;
    }

}