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

public class Solution {
    
    static int[] xMove={-1,1,2,1,-1,-2};
    static int[] yMove={2,2,0,2,2,0};
    
    static int[][] solution;
    
    Solution(int n)
    {
        solution=new int[n][n];
        for(int index1=0;index1<n;index1++)
        {
            for(int index2=0;index2<n;index2++)
                solution[index1][index2]=-1;
        }
    }
    
    static boolean isSafety(int x,int y,int n)
    {
        if(x>=0&&x<n&&y>=0&&y<n&&solution[x][y]!=-1)
            return true;
        else
            return false;
    }
    
    static boolean printShortestPathUtil(int i_start, int j_start, int i_end, int j_end,int move,int n)
    {
        if(i_start==i_end&&j_start==j_end)
        {
            System.out.println(move+1);
            return true;
        }
        
        for(int i=0;i<6;i++)
        {
            int xNewMove=i_start+xMove[i];
            int yNewMove=j_start+yMove[i];
            if(isSafety(xNewMove,yNewMove,n))
            {
                solution[xNewMove][yNewMove]=move;
                if(printShortestPathUtil(xNewMove, xNewMove,i_end, j_end,move+1,n))
                    return true;
                else
                    solution[xNewMove][yNewMove]=-1;
                    
                
            }
        }
        
        return false;
    }

    void printShortestPath(int n, int i_start, int j_start, int i_end, int j_end) {
        //  Print the distance along with the sequence of moves.
        
        solution[i_start][j_start]=0;
        
        if(!printShortestPathUtil(i_start, j_start,i_end, j_end,0,n))
        {
            System.out.println("Impossible");
        }
        
        
    }

    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();
        Solution s=new Solution(n);
        s.printShortestPath(n, i_start, j_start, i_end, j_end);
        in.close();
    }
}