250622

def Bfs() :
    global b, n, t, l
    queue = [[n[0]-1], [n[1]-1]]
    l[n[0]-1][n[1]-1] = 'n'
    l[t[0]-1][t[1]-1] = 't'
    while len(queue) != 0:
        q = queue.pop(0)
        if q[0] + 2 < b and q[1] + 1 > 0 and l[q[0] + 2][q[1] + 1] == 0 or 't':
            queue.append([q[0] + 2, q[1] + 1])
            l[q[0] + 2][q[1] + 1] = 'n'
        if q[0] + 2 < b and q[1] - 1 > 0 and l[q[0] + 2][q[1] - 1] == 0 or 't':
            queue.append([q[0] + 2, q[1] - 1])
            l[q[0] + 2][q[1] - 1] = 'n'
        if q[0] + 1 < b and q[1] + 2 > 0 and l[q[0] + 1][q[1] + 2] == 0 or 't':
            queue.append([q[0] + 1, q[1] + 2])
            l[q[0] + 1][q[1] + 2] = 'n'
        if q[0] - 1 < b and q[1] + 2 > 0 and l[q[0] - 1][q[1] + 2] == 0 or 't':
            queue.append([q[0] + 2, q[1] - 1])
            l[q[0] - 1][q[1] + 2] = 'n'
        if q[0] - 2 < b and q[1] + 1 > 0 and l[q[0] - 2][q[1] + 1] == 0 or 't':
            queue.append([q[0] - 2, q[1] + 1])
            l[q[0] - 2][q[1] + 1] = 'n'
        if q[0] - 2 < b and q[1] - 1 > 0 and l[q[0] - 2][q[1] - 1] == 0 or 't':
            queue.append([q[0] - 2, q[1] - 1])
            l[q[0] - 2][q[1] - 1] = 'n'
        if q[0] + 1 < b and q[1] - 2 > 0 and l[q[0] + 1][q[1] - 2] == 0 or 't':
            queue.append([q[0] + 1, q[1] - 2])
            l[q[0] + 1][q[1] - 2] = 'n'
        if q[0] - 1 < b and q[1] - 2 > 0 and l[q[0] - 1][q[1] - 2] == 0 or 't':
            queue.append([q[0] - 1, q[1] - 2])
            l[q[0] - 1][q[1] - 2] = 'n'
    
b = int(input())
n = list(map(int, input().split()))
t = list(map(int, input().split()))
l = [[0 for _ in range(b)] for _ in range(b)]
Bfs()