跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1561. Square Earth?

  • ID: 1567
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:基础
  • 上传者:
  • 搜索
  • 贪心
  • 模拟
  • 算法思想
  • 编程与模拟
  • 基础
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Square Earth?

题目描述

A. Square Earth?
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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).

Input

The single line contains 5 space-separated integers: n,x1,y1,x2,y2 (1≤n≤1000,0≤x1,y1,x2,y2≤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.

Output

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

Examples
Input
2 0 0 1 0
Output
1
Input
2 0 1 2 1
Output
4
Input
100 0 0 100 100
Output
200

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1081 题。保留原作者与原赛事署名。