The dormitory manager knows about students’ sleep problems and would like the students to get enough sleep and attend classes on time. Before the students move in, he decided to conduct a survey asking what time they go to bed. In the survey, he included only four options: at 22:00, at 23:00, at 00:00, and at 01:00. The manager wants to assign students to rooms so that the total lack of sleep among all students is minimal. Each room will house exactly two students. If a student goes to bed x hours earlier than their roommate, then that student loses x hours of sleep. For example, if two students live in the same room, the first student goes to bed at 22:00 and the second at 01:00, then the first student loses 3 hours of sleep, while the second student gets enough sleep.

Help the manager and find the minimum total lack of sleep among all students if the students are assigned to rooms optimally.

Four integers a₂₂, a₂₃, a₀₀, and a₀₁ are given in four lines (0 ≤ a₂₂, a₂₃, a₀₀, a₀₁ ≤ 10¹⁸) — the number of students who go to bed at 22:00, at 23:00, at 00:00, and at 01:00, respectively. The dormitory will be completely filled, so it is guaranteed that the sum a₂₂+a₂₃+a₀₀+a₀₁ is positive and even.

Print the minimum total number of hours of lost sleep among all students.