//
// Mult
//

public class Mult {

    public static boolean[][] f(boolean[][] A){
	int n = A.length;
	boolean[][] B = new boolean[n][n];
	for (int i=0;i<n;i++)
	    for (int j=0;j<n;j++)
		for (int k=0;k<n && !B[i][j];k++)
		    B[i][j] = B[i][j] || A[i][k] && A[k][j];
	return B;
    }
    //
    // name that function, and what's its complexity
    //

    public static void display(boolean[][] A){
	int n = A.length;
	for (int i=0;i<n;i++){
	    for (int j=0;j<n;j++)
		if (A[i][j])
		    System.out.print(1);
		else
		    System.out.print(0);
	    System.out.println();
	}
    }
    //
    // display an n by n adjacency matrix
    //
	

    public static void main(String[] args) {
	int n = 6;
	boolean[][] A = new boolean[n][n];
	A[0][1] = A[1][0] = true;
	A[1][2] = A[2][1] = true;
	A[2][3] = A[3][2] = true;
	A[2][5] = A[5][2] = true;
	A[3][4] = A[4][3] = true;
	
	boolean[][] B = f(A);

	display(A); // simple edges
	System.out.println();
	display(B); // length 2 edges

    }
}