A. ACC triangle
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Making tasks is hard. That's why Vlad went to play with hedgehogs and dice. He had 2 types of dice, $$$x$$$ dice with the letter A drawn on them, and $$$y$$$ dice with the letter C drawn on them. He came up with an ACC triangle, based on the principle of Pascal's triangle. On the $$$i$$$-th layer $$$(i \gt 0)$$$ of the ACC triangle, there should be exactly one letter A and exactly $$$i-1$$$ letters C following it.

example of an ACC triangle of height 4

Since Vlad doesn't have time for dice (he has hedgehogs), he asked you to tell him the maximum height of the triangle he can build from the dice he has.

Input

The only line of input data contains 2 integers $$$x$$$ and $$$y$$$ $$$(1 \le x, y \le 10^{18})$$$.

Output

Output a single integer — the answer to the problem.

Examples
Input
4 6
Output
4
Input
4 5
Output
3