CF57A.Square Earth?

Meg the Rabbit decided to do something nice, specifically — to determine the shortest distance between two points on the surface of our planet. But Meg... what can you say, she wants everything simple. So, she already regards our planet as a two-dimensional circle. No, wait, it's even worse — as a square of side n. Thus, the task has been reduced to finding the shortest path between two dots on a square (the path should go through the square sides). To simplify the task let us consider the vertices of the square to lie at points whose coordinates are: (0, 0), (n, 0), (0, n) and (n, n).

兔子梅格决定做一件好事——计算地球表面两点之间的最短距离。但梅格……你懂的，她凡事都追求简单。因此，她已将我们的星球视为一个二维圆。不，等等，情况甚至更糟——她将其视为一个边长为 $n$ 的正方形。于是，问题就简化为：在正方形上寻找两点之间的最短路径（该路径必须沿正方形的边行进）。为简化问题，我们假设正方形的四个顶点坐标分别为：$(0,\,0)$、$(n,\,0)$、$(0,\,n)$ 和 $(n,\,n)$。

The single line contains 5 space-separated integers: n, _x_1, _y_1, _x_2, _y_2 (1 ≤ n ≤ 1000, 0 ≤ _x_1, _y_1, _x_2, _y_2 ≤ n) which correspondingly represent a side of the square, the coordinates of the first point and the coordinates of the second point. It is guaranteed that the points lie on the sides of the square.

单行包含 5 个以空格分隔的整数：$n$、$x_1$、$y_1$、$x_2$、$y_2$（其中 $1 \leq n \leq 1000$，$0 \leq x_1, y_1, x_2, y_2 \leq n$），分别表示正方形的边长、第一个点的坐标以及第二个点的坐标。保证这两个点均位于正方形的边上。

You must print on a single line the shortest distance between the points.

你必须在一行中输出两点之间的最短距离。