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

public class Solution {
    static LinkedList<String> stack=new LinkedList<String>();
    static LinkedList<String> path;
    static int length=Integer.MAX_VALUE;
    static int move=0;
    static boolean isValidMove(int n,int i,int j){
        return (i>=0 && i<n && j>=0 && j<n);
    }
    static void ShortestPath(int n, int si, int sj, int ei, int ej) {
        //  Print the distance along with the sequence of moves.
        move++;
        if(si==ei && sj==ej && move < length){
            length=move;
            path=stack;
            return;
            }
        if(isValidMove(n,si-2,sj-1)){
            stack.push("UL");
            ShortestPath(n,si-2,sj-1,ei,ej);
        }
        if(isValidMove(n,si-2,sj+1)){
            stack.push("UR");
            ShortestPath(n,si-2,sj+1,ei,ej);
        }
        if(isValidMove(n,si,sj+2)){
            stack.push("L");
            ShortestPath(n,si,sj+2,ei,ej);
        }
        if(isValidMove(n,si+2,sj+1)){
            stack.push("UL");
            ShortestPath(n,si+2,sj+1,ei,ej);
        }
        if(isValidMove(n,si+2,sj-1)){
            stack.push("UL");
            ShortestPath(n,si+2,sj-1,ei,ej);
        }
        if(isValidMove(n,si,sj-2)){
            stack.push("UL");
            ShortestPath(n,si,sj-2,ei,ej);
        }
        
    }

    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();
        ShortestPath(n, i_start, j_start, i_end, j_end);
        System.out.println(move);
        in.close();
    }
}