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

public class Solution {

    static void printShortestPath(int moves, int n, int is, int js, int ie, int je) {
        //  Print the distance along with the sequence of moves.
        int[][] a = new int [n][n];
        int[] s = new int[n];
       
        if(a[is][js] == a[ie][je]){
            if(moves == 0){
                System.out.println("Impossible");
            }
            else{
                System.out.println(moves);
                for(int i=0;i<s.length;i++){
                    System.out.print(s[i]+" ");
                }
            }
        }
        
        else {
            for(int i=0;i<n;i++){
                for(int j=0;j<n;j++){
            if(a[i-2][j-1] != a[ie][je]){
                printShortestPath(moves,n,i-2,j-1,ie,je);
                moves++;
            }
            else if(a[i-2][j+1] != a[ie][je]){
                printShortestPath(moves,n,i-2,j+1,ie,je);
                moves++;
            }
            else if(a[i][j+2] != a[ie][je]){
                printShortestPath(moves,n,i,j+2,ie,je);
                moves++;
            }
            else if(a[i+2][j+1] != a[ie][je]){
                printShortestPath(moves,n,i+2,j+1,ie,je);
                moves++;
            }
            else if(a[i+2][j-1] != a[ie][je]){
                printShortestPath(moves,n,i+2,j-1,ie,je);
                moves++;
            }
            else if(a[i][j-2] != a[ie][je]){
                printShortestPath(moves,n,i,j-2,ie,je);
                moves++;
            }     
                }
            }
        }
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int moves = 0;
        int n = in.nextInt();
        int is = in.nextInt();
        int js = in.nextInt();
        int ie = in.nextInt();
        int je = in.nextInt();
        printShortestPath(moves,n, is, js, ie, je);
        in.close();
    }
}