import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        int[][] arr=new int[n][n];
        if(Math.abs(i_start-i_end)%2==0)
        {
            while(i_start<=i_end)
            {
                arr[i_start][j_start]=arr[i_start-2][j_start-1];
            i_start=i_start-2;
            j_start=j_start-1;
            
           System.out.println(arr);
            }
        }
        else
        {
            System.out.println("Impossible");
        }
        //  Print the distance along with the sequence of moves.
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int i_start = in.nextInt();
        int j_start = in.nextInt();
        int i_end = in.nextInt();
        int j_end = in.nextInt();
        printShortestPath(n, i_start, j_start, i_end, j_end);
        in.close();
    }
}