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) {
        //  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();
    }
} 
public void class gridPath{
//Variables&Initialized 
int grid(nxn);
int i_start;
int j_start; 
int i_end;
int j_end;
int UL;
int UR;
int R;
int LR;
int LL; 
int L; 
int printshortestPath;
int RK;//Red Knight 
public class printshortestPathTest{  
    do{
    int n()*int i_start*int j_start*int i_end*int j_end*printshortestPath(0,0,n-1,n-1);
    int printshortestPath=int validPath(UL,UR,R,LR,LL,L)*nextCount();
        ret int n,int pshortestPath*assertValue();
        System.out.prntln(Value of Grid&printShortestPath:nx,\nxij,stxi,xj,\nedxi,xj+"nx,\nxij,stxi,xj,nedxi,nedj+");
    }
    while{ 
        int n()*int printshortestPath()*moveInvalid();
        ret int printshortestPasth="Impossible";
        system.out.prntln(Value of Grid&printShortestPath:Impossible+"Impossible"+);
    }
    } 
}