Two biologist friends Vasily and Peter are going to Africa by train. They bought tickets at different times and could not get seats in the same carriage. Vasily bought a ticket for seat number X, and Peter — to place with number Y .
All trains in the structure of Russian Railways are equipped with cars with the same number of seats, equal to K. The numbering of seats is through: in the first car there are seats with numbers from 1 to K, in the second car — places with numbers from K + 1 to 2K, and so on. Help Vasily calculate how many times he has to move from one car to the next to meet with Peter.
Input
The first line of the input contains an integer K (1 ≤ K ≤ 10
9) — number of seats in each carriage.
The second line contains an integer X — Vasily's seat number.
The third line contains an integer Y (1 ≤ X < Y ≤ 10
9) — Petra's seat number.
Imprint
Print a single integer — the number of Vasily's transitions from one carriage to the next.
Examples