Uolevi owns a clock that has a 12-hour display. It runs at $x$ times the speed it should. Output the maximum number of times the clock can be correct during one day (a 24 hour period). See examples 2 and 3 to deduce how the edge cases are handled.

Input

The first line contains a single decimal number $x$. It is guaranteed that a correct solution can be deduced from the double-precision IEEE-754 floating point number representation of $x$. That is, you can use a double to store the value of $x$.

Output

Print the maximum number of times the clock can be correct during one day.

Constraints

• $0 \leq x \leq 100$
• $x \neq 1$

Example 1

Input:

0

Output:

2

Example 2

Input:

1.5

Output:

1

Example 3

Input:

1.501

Output:

2

Example 4

Input:

4.1380954486

Output:

7