Today an outstanding event is going to happen in the forest — hedgehog Filya will come to his old fried Sonya!

Sonya is an owl and she sleeps during the day and stay awake from minute $*l*_{1}$ to minute $*r*_{1}$ inclusive. Also, during the minute $*k*$ she prinks and is unavailable for Filya.

Filya works a lot and he plans to visit Sonya from minute $*l*_{2}$ to minute $*r*_{2}$ inclusive.

Calculate the number of minutes they will be able to spend together.

Input

The only line of the input contains integers $*l*_{1}$, $*r*_{1}$, $*l*_{2}$, $*r*_{2}$ and $*k*$ ($1 ≤ *l*_{1}, *r*_{1}, *l*_{2}, *r*_{2}, *k* ≤ 10^{18}$, $*l*_{1} ≤ *r*_{1}$, $*l*_{2} ≤ *r*_{2}$), providing the segments of time for Sonya and Filya and the moment of time when Sonya prinks.

Output

Print one integer — the number of minutes Sonya and Filya will be able to spend together.

Note

In the first sample, they will be together during minutes $9$ and $10$.

In the second sample, they will be together from minute $50$ to minute $74$ and from minute $76$ to minute $100$.